Parametric Interrupt Timed Automata

Béatrice Bérard 1 Serge Haddad 2, 3 Aleksandra Jovanovic 4 Didier Lime 4
1 MoVe - Modélisation et Vérification
LIP6 - Laboratoire d'Informatique de Paris 6
3 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
Abstract : Parametric reasoning is particularly relevant for timed models, but very often leads to undecidability of reachability problems. We propose a parametrised version of Interrupt Timed Automata (an expressive model incomparable to Timed Automata), where polynomials of parameters can occur in guards and updates. We prove that different reachability problems, including robust reachability, are decidable for this model, and we give complexity upper bounds for a fixed or variable number of clocks and parameters.
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Benedikt Bollig <>
Submitted on : Monday, January 27, 2014 - 4:12:33 PM
Last modification on : Thursday, March 21, 2019 - 1:05:16 PM

Links full text



Béatrice Bérard, Serge Haddad, Aleksandra Jovanovic, Didier Lime. Parametric Interrupt Timed Automata. 7th Workshop on Reachability Problems in Computational Models (RP'13), Sep 2013, Uppsala, Sweden. pp.59-69, ⟨10.1007/978-3-642-41036-9_7⟩. ⟨hal-00936961⟩



Record views