33 search results - page 1 / 7 » Reachability Problems on Extended O-Minimal Hybrid Automata |
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
HYBRID
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
HYBRID
2007
Springer
13 years 11 months ago
2007
Springer
This paper addresses questions regarding the decidability of hybrid automata that may be constructed hierarchically and in a modular way, as is the case in many exemplar systems, b...
FORMATS
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
HYBRID
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...