Skip to Main content Skip to Navigation
Conference papers

Consistency in Parametric Interval Probabilistic Timed Automata

Etienne André 1 Benoit Delahaye 2 
LINA - Laboratoire d'Informatique de Nantes Atlantique
Abstract : We propose a new abstract formalism for proba-bilistic timed systems, Parametric Interval Probabilistic Timed Automata, based on an extension of Parametric Timed Au-tomata 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 parameter valuations ensuring consistency is undecidable in the general context, but still propose a semi-algorithm that resolves it whenever it terminates.
Document type :
Conference papers
Complete list of metadata
Contributor : Benoît Delahaye Connect in order to contact the contributor
Submitted on : Wednesday, September 20, 2017 - 1:57:17 PM
Last modification on : Wednesday, April 27, 2022 - 3:56:43 AM


Files produced by the author(s)


  • HAL Id : hal-01590892, version 1


Etienne André, Benoit Delahaye. Consistency in Parametric Interval Probabilistic Timed Automata. 23rd International Symposium on Temporal Representation and Reasoning, Oct 2016, Copenhagen, Denmark. ⟨hal-01590892⟩



Record views


Files downloads