Files in this item



application/pdfA Decidable Cla ... Linear Hybrid Systems.pdf (193kB)
(no description provided)PDF


Title:A Decidable Class of Planar Linear Hybrid Systems
Author(s):Prabhakar, Pavithra; Vladimerou, Vladimeros; Viswanathan, Mahesh; Dullerud, Geir E.
Subject(s):computer science
Abstract:The paper shows the decidability of the reachability problem for planar, monotonic, linear hybrid automata without resets. These automata are a special class of linear hybrid automata with only two variables, whose flows in all states is monotonic along some direction in the plane, and in which the continuous variables are not reset on a discrete transition. We also prove the undecidability for the same class of automata in 4-dimensions.
Issue Date:2008-01
Genre:Technical Report
Other Identifier(s):UIUCDCS-R-2008-2927
Rights Information:You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).
Date Available in IDEALS:2009-04-22

This item appears in the following Collection(s)

Item Statistics