Interrupt Timed Automata with Auxiliary Clocks and Parameters

Abstract : Interrupt Timed Automata (ITA) are an expressive timed model, introduced to take into account interruptions according to levels. Due to this feature, this formalism is incomparable with Timed Automata. However several decidability results related to reachability and model checking have been obtained. We add auxiliary clocks to ITA, thereby extending its expressive power while preserving decidability of reachability. Moreover, we define a parametrized version of ITA, with polynomials of parameters appearing in guards and updates. While parametric reasoning is particularly relevant for timed models, it very often leads to undecidability results. We prove that various reachability problems, including robust reachability, are decidable for this model, and we give complexity upper bounds for a fixed or variable number of clocks, levels and parameters.
Type de document :
Article dans une revue
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2016, 143 (3-4), pp.235-259. 〈10.3233/FI-2016-1313〉
Liste complète des métadonnées

http://hal.upmc.fr/hal-01300505
Contributeur : Gestionnaire Hal-Upmc <>
Soumis le : lundi 11 avril 2016 - 10:46:58
Dernière modification le : vendredi 17 février 2017 - 16:15:03

Identifiants

Citation

Beatrice Bérard, Serge Haddad, Aleksandra Jovanović, Didier Lime. Interrupt Timed Automata with Auxiliary Clocks and Parameters. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2016, 143 (3-4), pp.235-259. 〈10.3233/FI-2016-1313〉. 〈hal-01300505〉

Partager

Métriques

Consultations de la notice

102