Consistency in Parametric Interval Probabilistic Timed Automata - Laboratoire d'Informatique de Paris-Nord Accéder directement au contenu
Article Dans Une Revue Journal of Logical and Algebraic Methods in Programming Année : 2020

Consistency in Parametric Interval Probabilistic Timed Automata

Résumé

We propose a new abstract formalism for probabilistic timed systems, Parametric Interval Probabilistic Timed Automata, based on an extension of Parametric Timed Automata and Interval Markov Chains. In this context, we consider the consistency problem that amounts to deciding whether a given specification admits at least one implementation. In the context of Interval Probabilistic Timed Automata (with no timing parameters), we show that this problem is decidable and propose a constructive algorithm for its resolution. We show that the existence of timing parameter valuations ensuring consistency is undecidable in the general context, but still exhibit a syntactic condition on parameters to ensure decidability. We also propose procedures that resolve both the consistency and the consistent reachability problems when the parametric probabilistic zone graph is finite.
Fichier principal
Vignette du fichier
S2352220817301372.pdf (583.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02154775 , version 1 (21-07-2022)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

Citer

Étienne André, Benoit Delahaye, Paulin Fournier. Consistency in Parametric Interval Probabilistic Timed Automata. Journal of Logical and Algebraic Methods in Programming, inPress, ⟨10.1016/j.jlamp.2019.04.007⟩. ⟨hal-02154775⟩
84 Consultations
28 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More