Latest info: Pictures now online. |
We extend probabilistic computational tree logic for expressing properties of Markov chains to imprecise Markov chains, and provide an efficient algorithm for model checking of imprecise Markov chains. Thereby, we provide a formal framework to answer a very wide range of questions about imprecise Markov chains, in a systematic and computationally efficient way.
The paper is available in the following formats:
Matthias Troffaes | matthias.troffaes@gmail.com | |
Damjan Skulj | damjan.skulj@fdv.uni-lj.si/a> |
Send any remarks to isipta13@hds.utc.fr.