Are Timed Automata UpdatableReportar como inadecuado

Are Timed Automata Updatable - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 LSV - Laboratoire Spécification et Vérification Cachan 2 EDF R&D - EDF Recherche et Développement 3 LaBRI - Laboratoire Bordelais de Recherche en Informatique

Abstract : In classical timed automata, as dened by Alur and Dill AD90,AD94 and since widely studied, the only operation allowed to modify the clocks is the reset operation. For instance, a clock can neither be set to a non-null constant value, nor be set to the value of another clock nor, in a non-deterministic way, to some value lower or higher than a given constant. In this paper we study in details such updates. We characterize in a thin way the frontier between decidability and undecidability. Our main contributions are the following:- We exhibit many classes of updates for which emptiness is undecidable. These classes depend on the clock constraints that are used diagonal-free or not whereas it is well known that these two kinds of constraints are equivalent for classical timed automata.- We propose a generalization of the region automaton proposed by Alur and Dill, allowing to handle larger classes of updates. The complexity of the decision procedure remains Pspace-complete.

Autor: Patricia Bouyer - Catherine Dufourd - Emmanuel Fleury - Antoine Petit -



Documentos relacionados