TY - GEN
T1 - A decidable class of planar linear hybrid systems
AU - Prabhakar, Pavithra
AU - Vladimerou, Vladimeros
AU - Viswanathan, Mahesh
AU - Dullerud, Geir E.
PY - 2008
Y1 - 2008
N2 - The paper shows the decidability of the reachability problem for planar, monotonic, linearhybrid automata without resets. These automata are a special class of linear hybrid automata withonly two variables, whose flows in all states is monotonic along some direction in the plane, andin which the continuous variables are not reset on a discrete transition.
AB - The paper shows the decidability of the reachability problem for planar, monotonic, linearhybrid automata without resets. These automata are a special class of linear hybrid automata withonly two variables, whose flows in all states is monotonic along some direction in the plane, andin which the continuous variables are not reset on a discrete transition.
UR - http://www.scopus.com/inward/record.url?scp=70350025762&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70350025762&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-78929-1_29
DO - 10.1007/978-3-540-78929-1_29
M3 - Conference contribution
AN - SCOPUS:70350025762
SN - 3540789286
SN - 9783540789284
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 401
EP - 414
BT - Hybrid Systems
PB - Springer
T2 - 11th International Workshop on Hybrid Systems: Computation and Control, HSCC 2008
Y2 - 22 April 2008 through 24 April 2008
ER -