Expressiveness of Updatable Timed Automata

Patricia Bouyer (1) , Catherine Dufourd (2) , Emmanuel Fleury (3) , Antoine Petit (1)

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 EDF - EDF
3 LaBRI - Laboratoire Bordelais de Recherche en Informatique

Since their introduction by Alur and Dill, timed automata have been one of the most widely studied models for real-time systems. The syntactic extension of so-called updatable timed automata allows more powerful updates of clocks than the reset operation proposed in the original model. We prove that any language accepted by an updatable timed automaton (from classes where emptiness is decidable) is also accepted by a “classical” timed automaton. We propose even more precise results on bisimilarity between updatable and classical timed automata.

Domaines: Autre [cs.OH]

Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit. Expressiveness of Updatable Timed Automata. 25th International Symposium of Mathematical Foundation of Computer Science (MFCS'2000), 2000, Bratislava, Slovakia. pp.232-242, ⟨10.1007/3-540-44612-5_19⟩. ⟨hal-00350490⟩