27 search results - page 1 / 6 » Decidability and Complexity Results for Timed Automata and S... |
132
Voted
HYBRID
2000
Springer
15 years 3 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...
77
Voted
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
88
Voted
HYBRID
1997
Springer
15 years 4 months ago
1997
Springer
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighbo...
120
Voted
FORMATS
2008
Springer
15 years 1 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...
126
Voted
ATVA
2010
Springer
15 years 1 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...