Parametric LTL on Markov Chains - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Parametric LTL on Markov Chains


This paper is concerned with the verification of finite Markov chains against parametrized LTL (pLTL) formulas. In pLTL, the until-modality is equipped with a bound that contains variables; e.g., $\Diamond _{\leqslant x}\ \varphi$ asserts that ϕ holds within x time steps, where x is a variable on natural numbers. The central problem studied in this paper is to determine the set of parameter valuations V ≺ p (ϕ) for which the probability to satisfy pLTL-formula ϕ in a Markov chain meets a given threshold ≺ p, where ≺ is a comparison on reals and p a probability. As for pLTL determining the emptiness of V> 0(ϕ) is undecidable, we consider several logic fragments. We consider parametric reachability properties, a sub-logic of pLTL restricted to next and $\Diamond _{\leqslant x}$, parametric Büchi properties and finally, a maximal subclass of pLTL for which emptiness of V> 0(ϕ) is decidable.
Fichier principal
Vignette du fichier
978-3-662-44602-7_17_Chapter.pdf (384.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01402042 , version 1 (24-11-2016)





Souymodip Chakraborty, Joost-Pieter Katoen. Parametric LTL on Markov Chains. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.207-221, ⟨10.1007/978-3-662-44602-7_17⟩. ⟨hal-01402042⟩
62 View
53 Download



Gmail Facebook Twitter LinkedIn More