114 search results - page 2 / 23 » A Determinizable Class of Timed Automata |
71
Voted
FORMATS
2003
Springer
15 years 3 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
83
Voted
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
82
Voted
CORR
2011
Springer
14 years 5 months 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...
110
click to vote
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...