DellaPenna_etal2006
ArticleInAPeriodical
Berlin, Heidelberg
Springer-Verlag
2006
Int. J. Softw. Tools Technol. Transf.
8
4
397-409
Della PennaGiuseppe
IntrigilaBenedetto
MelattiIgor
TronciEnrico
Venturini ZilliMarisa
Finite horizon analysis of Markov Chains with the Mur$\varphi$ verifier
In this paper we present an explicit disk-based verification algorithm for Probabilistic Systems defining discrete time/finite state Markov Chains. Given a Markov Chain and an integer k (horizon), our algorithm checks whether the probability of reaching an error state in at most k steps is below a given threshold. We present an implementation of our algorithm within a suitable extension of the Mur$\varphi$ verifier. We call the resulting probabilistic model checker FHP-Mur$\varphi$ (Finite Horizon Probabilistic Mur$\varphi$). We present experimental results comparing FHP-Mur$\varphi$ with (a finite horizon subset of) PRISM, a state-of-the-art symbolic model checker for Markov Chains. Our experimental results show that FHP-Mur$\varphi$ can handle systems that are out of reach for PRISM, namely those involving arithmetic operations on the state variables (e.g. hybrid systems).