On reachability for hybrid automata over bounded time

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) rea...

Volledige beschrijving

Bibliografische gegevens
Hoofdauteurs: Brihaye, T, Doyen, L, Geeraerts, G, Ouaknine, J, Raskin, J, Worrell, J
Formaat: Journal article
Taal:English
Gepubliceerd in: 2011