Reachability in parametric Interval Markov Chains using constraints - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2018

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 labelled with parametric intervals of probabilities. In this work, we study the difference between pIMCs and other Markov Chain abstractions models and investigate three semantics for IMCs: once-and-for-all, interval-Markov-decision-process, and at-every-step. In particular, we prove that all three 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.
Fichier principal
Vignette du fichier
1706.00270v1.pdf (347.05 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01917092 , version 1 (24-05-2024)

Identifiers

Cite

Anicet Bart, Benoît Delahaye, Didier Lime, Eric Monfroy, Charlotte Truchet. Reachability in parametric Interval Markov Chains using constraints. Theoretical Computer Science, 2018, 747, pp.48-74. ⟨10.1016/j.tcs.2018.06.016⟩. ⟨hal-01917092⟩
80 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More