HAL: hal-00350488, version 1

DOI: 10.1007/10722167_35

Detailed view

Export this paper BibTeX - EndNote - TEI - RefWorks -

12th International Conference on Computer Aided Verification (CAV'2000), Chicago : États-Unis (2000)

Are Timed Automata Updatable ?

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

(2000)

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.

1:	Laboratoire Spécification et Vérification [Cachan] (LSV)
	CNRS : UMR8643 – INRIA – École normale supérieure de Cachan - ENS Cachan
2:	EDF R&D
	EDF
3:	Laboratoire Bordelais de Recherche en Informatique (LaBRI)
	CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II

Subject

:

Computer Science/Other

hal-00350488, version 1

http://hal.archives-ouvertes.fr/hal-00350488

oai:hal.archives-ouvertes.fr:hal-00350488

From: Emmanuel Fleury <>

Submitted on: Tuesday, 6 January 2009 19:13:36

Updated on: Sunday, 11 January 2009 15:24:51