33 search results - page 2 / 7 » Reachability Problems on Extended O-Minimal Hybrid Automata |
CORR
2011
Springer
13 years 10 days ago
2011
Springer
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 locat...
FOSSACS
2009
Springer
14 years 3 days ago
2009
Springer
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...
ATVA
2010
Springer
13 years 6 months ago
2010
Springer
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
FORMATS
2006
Springer
13 years 9 months ago
2006
Springer
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as...
ATVA
2008
Springer
13 years 7 months ago
2008
Springer
We identify a new class of decidable hybrid automata: namely, parallel compositions of semi-algebraic o-minimal automata. The class we consider is fundamental to hierarchical model...