Timed Automata with Parametric Updates

Abstract : Timed automata (TAs) represent a powerful formalism to model and verify systems where concurrency is mixed with hard timing constraints. However, they can seem limited when dealing with uncertain or unknown timing constants. Several parametric extensions were proposed in the literature, and the vast majority of them leads to the undecidability of the EF-emptiness problem: "is the set of valuations for which a given location is reachable empty?" Here, we study an extension of TAs where clocks can be updated to a parameter. While the EF-emptiness problem is undecidable for rational-valued parameters, it becomes PSPACE-complete for integer-valued parameters. In addition, exact synthesis of the parameter valuations set can be achieved. We also extend these two results to the EF-universality ("are all valuations such that a given location is reachable?"), AF-emptiness ("is the set of valuations for which a given location is unavoidable empty?") and AF-universality ("are all valuations such that a given location is unavoidable?") problems.
Document type :
Conference papers
Liste complète des métadonnées

Contributor : Didier Lime <>
Submitted on : Monday, December 17, 2018 - 10:37:07 AM
Last modification on : Tuesday, March 26, 2019 - 9:25:22 AM
Document(s) archivé(s) le : Monday, March 18, 2019 - 2:15:31 PM


Files produced by the author(s)



Étienne André, Didier Lime, Mathias Ramparison. Timed Automata with Parametric Updates. 18th International Conference on Application of Concurrency to System Design (ACSD 2018), Jun 2018, Bratislava, Slovakia. pp.21-29, ⟨10.1109/acsd.2018.000-2⟩. ⟨hal-01957157⟩



Record views


Files downloads