Parametric Interrupt Timed Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Parametric Interrupt Timed Automata

Résumé

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.

Dates et versions

hal-00936961 , version 1 (27-01-2014)

Identifiants

Citer

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⟩
294 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More