Integer-Complete Synthesis for Bounded Parametric Timed Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Integer-Complete Synthesis for Bounded Parametric Timed Automata

Étienne André
Didier Lime
STR
Olivier Henri Roux
STR

Résumé

Ensuring the correctness of critical real-time systems, involving concurrent behaviors and timing requirements, is crucial. Parameter synthesis aims at computing dense sets of valuations for the timing requirements , guaranteeing a good behavior. However, in most cases, the emptiness problem for reachability (i.e., whether there exists at least one parameter valuation for which some state is reachable) is undecid-able and, as a consequence, synthesis procedures do not terminate in general, even for bounded parameters. In this paper, we introduce a parametric extrapolation, that allows us to derive an underapproxima-tion in the form of linear constraints containing all the integer points ensuring reachability or unavoidability, and all the (non-necessarily integer) convex combinations of these integer points, for general PTA with a bounded parameter domain. Our algorithms terminate and can output constraints arbitrarily close to the complete result.
Fichier principal
Vignette du fichier
andre-RP-15.pdf (885.57 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02939637 , version 1 (15-09-2020)

Identifiants

Citer

Étienne André, Didier Lime, Olivier Henri Roux. Integer-Complete Synthesis for Bounded Parametric Timed Automata. 9th International Conference on Reachability Problems (RP 2015), Sep 2015, Warsaw, Poland. pp.7-19, ⟨10.1007/978-3-319-24537-9_2⟩. ⟨hal-02939637⟩
45 Consultations
69 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More