Abstract
In this paper algorithms for model checking CSL (continuous stochastic logic) against infinite-state continuous-time Markov chains of so-called quasi birth-death type are developed. In doing so we extend the applicability of CSL model checking beyond the recently proposed case for finite-state continuous-time Markov chains, to an important class of infinite-state Markov chains. We present syntax and semantics for CSL and develop efficient model checking algorithms for the steady-state operator and the time-bounded next and until operator. For the former, we rely on the so-called matrix-geometric solution of the steady-state probabilities of the infinite-state Markov chain. For the time-bounded until operator we develop a new algorithm for the transient analysis of infinite-state Markov chains, thereby exploiting the quasi birth-death structure. A case study shows the feasibility of our approach. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Remke, A., Haverkort, B. R., & Cloth, L. (2005). Model checking infinite-state Markov chains. In Lecture Notes in Computer Science (Vol. 3440, pp. 237–252). Springer Verlag. https://doi.org/10.1007/978-3-540-31980-1_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.