Model Checking CSL until Formulae with Random Time Bounds
Continuous Time Markov Chains (CTMCs) are widely used as the underlying stochastic process in performance and dependability analysis. Model checking of CTMCs against Continuous Stochastic Logic (CSL) has been investigated previously by a number of authors [2,4,13]. CSL contains a time-bounded until operator that allows one to express properties such as “the probability of 3 servers becoming faulty within 7.01 seconds is at most 0.1”. In this paper we extend CSL with a random time-bounded until operator, where the time bound is given by a random variable instead of a fixed real-valued time (or interval). With the help of such an operator we can state that the probability of reaching a set of goal states within some generally distributed delay while passing only through states that satisfy a certain property is at most (at least) some probability threshold. In addition, certain transient properties of systems which contain general distributions can be expressed with the extended logic. We extend the efficient model checking of CTMCs against the logic CSL developed in  to cater for the new operator. Our method involves precomputing a family of coefficients for a range of random variables which includes Pareto, uniform and gamma distributions, but otherwise carries the same computational cost as that for ordinary time-bounded until in . We implement the algorithms in Matlab and evaluate them by means of a queueing system example.
KeywordsModel Check Random Time Pareto Distribution Queueing System Continuous Time Markov Chain
Unable to display preview. Download preview PDF.
- 1.A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Verifying continuous time Markov chains. In Proc. CAV’96, volume 1102 of LNCS, pages 269–276. Springer, 1996.Google Scholar
- 3.C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In Proc. CAV 2000, volume 1855 of LNCS, pages 358–372, 2000.Google Scholar
- 4.C. Baier, J.-P. Katoen, and H. Hermanns. Approximative symbolic model checking of continuous-time Markov chains. In Proc. CONCUR’99, volume 1664 of LNCS, pages 146–162. Springer, 1999.Google Scholar
- 8.R. German. Performance Analysis of Communication Systems: Modeling with Non-Markovian Stochastic Petri Nets. John Wiley and Sons, 2000.Google Scholar
- 9.J. Grandell. Mixed Poisson Processes. Chapman & Hall, 1997.Google Scholar
- 12.A. Jensen. Markov chains as an aid in the study of Markov processes. Skandinavisk Aktuarietidsskrift, Marts, pages 87–91, 1953.Google Scholar
- 13.J.-P. Katoen, M. Kwiatkowska, G. Norman, and D. Parker. Faster and symbolic CTMC model checking. In Proc. PAPM-PROBMIV 2001, volume 2165 of LNCS, pages 23–38. Springer, 2001.Google Scholar
- 14.M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: A hybrid approach. In Proc. TACAS 2002, volume 2280 of LNCS, pages 52–66. Springer, 2002.Google Scholar
- 15.G.I. Lópes, H. Hermanns, and J.-P. Katoen. Beyond memoryless distributions. In Proc PAPM-PROBMIV 2001, volume 2165 of LNCS, pages 57–70. Springer, 2001.Google Scholar
- 16.S. Molnár and I. Maricza, editors. Source characterization in broadband networks. COST 257 Mid-term seminar interim report on source characterization, 2000.Google Scholar
- 17.J. Muppala and K. Trivedi. Queueing Systems, Queueing and Related Models, chapter Numerical Transient Solution of Finite Markovian Queueing Systems, pages 262–284. Oxford University Press, 1992.Google Scholar
- 19.PRISM web page. http://www.cs.bham.ac.uk/~dxp/prism/.
- 20.W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton, 1994.Google Scholar