This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time units, where T is a constant rational value. We show that, in contrast to the classical (unbounded) reachability problem, the timed-bounded version is decidable for rectangular hybrid automata provided only non-negative rates are allowed. This class of systems is of practical interest and subsumes, among others, the class of stopwatch automata. We also show that the problem becomes undecidable if either diagonal constraints or both negative and positive rates are allowed. © 2011 Springer-Verlag.
CITATION STYLE
Brihaye, T., Doyen, L., Geeraerts, G., Ouaknine, J., Raskin, J. F., & Worrell, J. (2011). On reachability for hybrid automata over bounded time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6756 LNCS, pp. 416–427). https://doi.org/10.1007/978-3-642-22012-8_33
Mendeley helps you to discover research relevant for your work.