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

We investigate extensions of Alur and Dill's timed automata, based on the possibility to update the clocks in a more elaborate way than simply reset them to zero. We call these automata updatable timed automata. They form an undecidable class of models, in the sense that emptiness checking is not decidable. However, using an extension of the region graph construction, we exhibit interesting decidable subclasses. In a surprising way, decidability depends on the nature of the clock constraints which are used, diagonal-free or not, whereas these constraints play identical roles in timed automata. We thus describe in a quite precise way the thin frontier between decidable and undecidable classes of updatable timed automata. We also study the expressive power of updatable timed automata. It turns out that any updatable automaton belonging to some decidable subclass can be effectively transformed into an equivalent timed automaton without updates but with silent transitions. The transformation suffers from an enormous combinatorics blow-up which seems unavoidable. Therefore, updatable timed automata appear to be a concise model for representing and analyzing large classes of timed systems.

Domaines: Autre [cs.OH]

Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit. Updatable Timed Automata. Theoretical Computer Science, 2004, 321 (2-3), pp.291-345. ⟨10.1016/j.tcs.2004.04.003⟩. ⟨hal-00350196⟩