Skip to Main content Skip to Navigation
Journal articles

Consistency in Parametric Interval Probabilistic Timed Automata

Abstract : 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.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-02154775
Contributor : Accord Elsevier CCSD Connect in order to contact the contributor
Submitted on : Thursday, July 21, 2022 - 7:32:55 AM
Last modification on : Friday, August 5, 2022 - 2:54:51 PM

File

S2352220817301372.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License

Identifiers

Citation

Étienne André, Benoit Delahaye, Paulin Fournier. Consistency in Parametric Interval Probabilistic Timed Automata. Journal of Logical and Algebraic Methods in Programming, Elsevier, In press, ⟨10.1016/j.jlamp.2019.04.007⟩. ⟨hal-02154775⟩

Share

Metrics

Record views

77

Files downloads

3