When Are Timed Automata Determinizable?
نویسندگان
چکیده
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 boundedness condition, the infinite timed tree can be reduced into a classical deterministic timed automaton. The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be determinizable (eventclock timed automata, automata with integer resets), but some others were not. We prove for instance that strongly non-Zeno timed automata can be determinized. As a corollary of those constructions, we get for those classes the decidability of the universality and of the inclusion problems, and compute their complexities (the inclusion problem is for instance EXPSPACE-complete for strongly non-Zeno timed automata).
منابع مشابه
Christel Baier , Nathalie Bertrand , Patricia Bouyer and Thomas Brihaye When are Timed Automata Determinizable ? Research Report LSV - 09 - 08 14 April 2009
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 boundedness condition, the infinite timed tree can be reduced into a classical deterministic timed automaton. The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be d...
متن کاملA Game Approach to Determinize Timed Automata
Timed automata are a usual model for the specification of real time systems. Their determinization is a key issue for several problems such as implementability, diagnosis or test generation. There exist non-determinizable timed automata and, unfortunately, determinizability of timed automata is an undecidable problem. Recently, two approaches have been proposed: a determinization procedure [2] ...
متن کاملEvent-Clock Automata: A Determinizable Class of Timed Automata
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. The class of event-recording automata is, on one hand, expressive enough to model ( nite) timed transition systems and, on the other hand, determinizable and closed under all boolean operations. As a result, the lan...
متن کاملDurational Actions Timed Automata: Determinization and Expressiveness
In this paper we present durational actions timed automata, DATA*, as a sub class of timed automata. In the contrast of T.A, the underling semantic of DATA* is the maximality semantics which claim that actions have durations and true concurrency is captured differently from choice. DATA* model is in one hand useful for modeling and validating reel aspects of systems. In the other hand, it is de...
متن کاملOn Decision Problems for Timed Automata
We solve some decision problems for timed automata which were raised by Tripakis in [9] and by Asarin in [3]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a timed regular language is timed regular.
متن کامل