Reachability in Parametric Interval Markov Chains using Constraints

Abstract : Parametric Interval Markov Chains (pIMCs) are a specification formalism that extend Markov Chains (MCs) and Interval Markov Chains (IMCs) by taking into account imprecision in the transition probability values: transitions in pIMCs are labeled with parametric intervals of probabilities. In this work, we study the difference between pIMCs and other Markov Chain abstractions models and investigate the two usual semantics for IMCs: once-and-for-all and at-every-step. In particular, we prove that both semantics agree on the maximal/minimal reachability probabilities of a given IMC. We then investigate solutions to several parameter synthesis problems in the context of pIMCs – consistency, qualitative reachability and quantitative reachability – that rely on constraint encodings. Finally, we propose a prototype implementation of our constraint encodings with promising results.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download
Contributor : Benoît Delahaye <>
Submitted on : Wednesday, May 31, 2017 - 11:36:56 AM
Last modification on : Tuesday, March 26, 2019 - 9:25:22 AM
Long-term archiving on : Wednesday, September 6, 2017 - 2:38:14 PM


Files produced by the author(s)


  • HAL Id : hal-01529681, version 1
  • ARXIV : 1706.00270


Anicet Bart, Benoit Delahaye, Didier Lime, Eric Monfroy, Charlotte Truchet. Reachability in Parametric Interval Markov Chains using Constraints. 2017. ⟨hal-01529681⟩



Record views


Files downloads