101 search results - page 1 / 21 » When Are Timed Automata Determinizable |
117
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
173
click to vote
CAV
1994
Springer
15 years 7 months ago
1994
Springer
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...
123
click to vote
FORMATS
2006
Springer
15 years 6 months ago
2006
Springer
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
120
click to vote
SOFSEM
2009
Springer
16 years 1 days ago
2009
Springer
Abstract. We introduce the class of event-clock visibly pushdown automata (ECVPAs) as an extension of event-clock automata. The class of ECVPAs, on one hand, can model simple real-...
118
click to vote
FORMATS
2003
Springer
15 years 8 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...