Abstract
The verification of continuous-time Markov chains (CTMCs) against continuous stochastic logic (CSL) [3,6], a stochastic branching-time temporal logic, is considered. CSL facilitates among others the specification of steady-state properties and the specification of probabilistic timing properties of the form \({\cal P}_{\bowtie p}(\Phi_1 \, {\cal U}^{I} \, \Phi_2)\), for state formulas Φ1 and Φ2, comparison operator ⋈, probability p, and real interval I. The main result of this paper is that model checking probabilistic timing properties can be reduced to the problem of computing transient state probabilities for CTMCs. This allows us to verify such properties by using efficient techniques for transient analysis of CTMCs such as uniformisation. A second result is that a variant of ordinary lumping equivalence (i.e., bisimulation), a well-known notion for aggregating CTMCs, preserves the validity of all CSL-formulas.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ajmone Marsan, M., Balb, G., Conte, G., Donatelli, S., Ranceschinis, G.F.: Modelling with Generalized Stochastic Petri Nets. John Wiley & Sons, Chichester (1995)
[2] A.Aziz, V.Singhal, F.Balarin, R.Bra yton and A.Sangio vanni-Vincentelli. It usually works: the temporal logic of stochastic systems.In CAV, LNCS 939, pp. 155–165, 1995.
Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Verifying continuous time Markov chains. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 269–276. Springer, Heidelberg (1996)
Bahar, I., Frohm, E., Gaona, C., Hachtel, G., Macii, E., Padro, A., Somenzi, F.: Algebraic decision diagrams and their applications. Form. Meth. in Syst. Design 10(2/3), 171–206 (1997)
Baier, C.: On algorithmic verification methods for probabilistic systems. Habilitation thesis, Univ. of Mannheim (1999)
Baier, C., Katoen, J.-P., Hermanns, H.: Approximate symbolic model checking of continuous-time markov chains (Extended abstract). In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 146–162. Springer, Heidelberg (1999)
Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: On the logical characterization of performability properties. In: ICALP. LNCS (2000) (to appear)
Brown, M., Clarke, E., Grumberg, O.: Characterizing finite Kripke structures in propositional temporal logic. Th. Comp. Sc. 59, 115–131 (1988)
Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Trans. on Comp. C-35(8), 677–691 (1986)
Buchholz, P.: Exact and ordinary lumpability in finite Markov chains. J. of Appl. Prob. 31, 59–75 (1994)
Buchholz, P.: Markovian process algebra. Tech. Rep. 500, Fachbereich Informatik, Univ. of Dortmund (1994)
Clarke, E., Fujita, M., McGeer, P., Yang, J., Zhao, X.: Multi-terminal binary decision diagrams: an efficient data structure for matrix representation. In: Proc. IEEE Int. Workshop on Logic Synthesis, pp. 1–15 (1993)
Courcoubetis, C., Yannakakis, M.: Verifying temporal properties of finite-state probabilistic programs. In: Proc. IEEE Symp. on Found. of Comp. Sc., pp. 338–345 (1988)
Fox, B.L., Glynn, P.W.: Computing Poisson probabilities. Comm. of the ACM 31(4), 440–445 (1988)
Grassmann, W.K.: Finding transient solutions in Markovian event systems through randomization. In: Stewart, W.J. (ed.) Num. Sol. of Markov Chains, pp. 357–371. Marcel Dekker, New York (1991)
Gross, D., Miller, D.R.: The randomization technique as a modeling tool and solution procedure for transient Markov chains. Oper. Res. 32(2), 343–361 (1984)
Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Form. Asp. of Comp. 6, 512–535 (1994)
Haverkort, B.R.: Performance of Computer Communication Systems: A Model- Based Approach. John Wiley & Sons, Chichester (1998)
Haverkort, B.R., Niemegeers, I.: Performability modelling tools and techniques. Perf. Ev. 25, 17–40 (1996)
Hermanns, H., Herzog, U., Katoen, J.-P.: Process algebra for performance evaluation. Th. Comp. Sc. (2000) (to appear)
Hermanns, H., Katoen, J.-P.: Automated compositional Markov chain generation for a plain-old telephone system. Sci. of Comp. Programming 36(1), 97–127 (2000)
Hermanns, H., Katoen, J.-P., Meyer-Kayser, J., Siegle, M.: A Markov chain model checker. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol. 1785, pp. 347–362. Springer, Heidelberg (2000)
Hermanns, H., Siegle, M.: Bisimulation algorithms for stochastic process algebras and their BDD-based implementation. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol. 1601, pp. 244–265. Springer, Heidelberg (1999)
Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, Cambridge (1996)
Jensen, A.: Markov chains as an aid in the study of Markov processes. Skand. Aktuarietidskrift 3, 87–91 (1953)
Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. and Comp. 94(1), 1–28 (1992)
van Moorsel, A.P.A., Haverkort, B.R.: Probabilistic evaluation for the analytical solution of large Markov models. Microelectron and Reliab. 36(6), 733–755 (1996)
Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton Univ. Press, Princeton (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baier, C., Haverkort, B., Hermanns, H., Katoen, JP. (2000). Model Checking Continuous-Time Markov Chains by Transient Analysis. In: Emerson, E.A., Sistla, A.P. (eds) Computer Aided Verification. CAV 2000. Lecture Notes in Computer Science, vol 1855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722167_28
Download citation
DOI: https://doi.org/10.1007/10722167_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67770-3
Online ISBN: 978-3-540-45047-4
eBook Packages: Springer Book Archive