On the power of non-observable actions in timed automata
- Cite this paper as:
- Bérard B., Gastin P., Petit A. (1996) On the power of non-observable actions in timed automata. In: Puech C., Reischuk R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg
Timed finite automata, introduced by Alur and Dill, are one of the most widely studied models for real-time systems. We focus in this paper on the power of silent transitions, i.e. ε-transitions, in such automata. We show that ε-transitions strictly increase the power of timed automata and that the class of timed languages recognized by automata with ε-transitions is much more robust than the corresponding class without ε-transitions. Our main result shows that these transitions increase the power of these automata only if they reset clocks.
Unable to display preview. Download preview PDF.