Sciweavers

CORR
2011
Springer

On Reachability for Hybrid Automata over Bounded Time

12 years 10 months ago
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) 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.
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, J
Added 13 May 2011
Updated 13 May 2011
Type Journal
Year 2011
Where CORR
Authors Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
Comments (0)