665 search results - page 4 / 133 » The Theory of Hybrid Automata |
FSEN
2009
Springer
14 years 3 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
HYBRID
2003
Springer
14 years 1 months ago
2003
Springer
The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable inter...
HYBRID
1994
Springer
14 years 21 days ago
1994
Springer
HYBRID
2007
Springer
14 years 2 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...
HYBRID
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. This paper describes the implementation of predicate abstraction techniques to automatically compute symbolic backward reachable sets of high dimensional piecewise affine...