Consistency in Parametric Interval Probabilistic Timed Automata - LINA-AELOS Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Consistency in Parametric Interval Probabilistic Timed Automata

Etienne André
Benoit Delahaye

Résumé

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.
Fichier principal
Vignette du fichier
TIME16.pdf (173.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01590892 , version 1 (20-09-2017)

Identifiants

  • HAL Id : hal-01590892 , version 1

Citer

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⟩
214 Consultations
72 Téléchargements

Partager

Gmail Facebook X LinkedIn More