On reachability for hybrid automata over bounded time

Journal article

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, ...

Expand abstract

Authors: Brihaye, T; Doyen, L; Geeraerts, G; Ouaknine, J; Raskin, J

• Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
• Volume: 6756 LNCS
• Issue: PART 2
• Pages: 416-427
• Publication date: 2011-01-01
• DOI: 10.1007/978-3-642-22012-8_33
• EISSN: 1611-3349
• ISSN: 0302-9743
• Language: English