On the power of non-observable actions in timed automata

  • Béatrice Bérard
  • Paul Gastin
  • Antoine Petit
Conference paper

DOI: 10.1007/3-540-60922-9_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1046)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Béatrice Bérard
    • 1
  • Paul Gastin
    • 2
  • Antoine Petit
    • 1
  1. 1.LIFACENS de CachanCachan CedexFrance
  2. 2.LITP - IBPUniversité Paris 7Paris Cedex 05France

Personalised recommendations