A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Symbolic and Parametric Model Checking of Discrete-Time Markov Chains
[chapter]
2005
Lecture Notes in Computer Science
We present a language-theoretic approach to symbolic model checking of PCTL over discrete-time Markov chains. The probability with which a path formula is satisfied is represented by a regular expression. A recursive evaluation of the regular expression yields an exact rational value when transition probabilities are rational, and rational functions when some probabilities are left unspecified as parameters of the system. This allows for parametric model checking by evaluating the regular
doi:10.1007/978-3-540-31862-0_21
fatcat:ppq4b2y4jzdsff7drnv2yjrkji