Skip to main content
SpringerLink
Log in

Faster and Symbolic CTMC Model Checking

  • Conference paper
  • First Online:
Process Algebra and Probabilistic Methods. Performance Modelling and Verification (PAPM-PROBMIV 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2165))

Abstract

This paper reports on the implementation and the experiments with symbolic model checking of continuous-time Markov chains using multi-terminal binary decision diagrams (MTBDDs). Properties are expressed in Continuous Stochastic Logic (CSL) [7] which includes the means to express both transient and steady-state performance measures. We show that all CSL operators can be treated using standard operations on MTBDDs, thus allowing a rather straightforward implementation of symbolic CSL model checking on existing MTBDD-based platforms such as the verifier PRISM. The main result of the paper is an improvement of O(N) in the time complexity of checking time-bounded until-formulas, where N is the number of states in the CTMC under consideration. This result yields a drastic speed-up in the verification time of model checking CTMCs, both in the symbolic and non-symbolic case.

Partly supported by EPSRC grants GR/M04617, GR/M13046 and GR/N31573.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur and T.A. Henzinger. Reactive modules. In IEEE Symp. on Logic in Computer Science, 207–218, 1996.

    Google Scholar 

  2. A. Aziz, K. Sanwal, V. Singhal and R. Brayton. Verifying continuous time Markov chains. In Computer-Aided Verification, LNCS 1102: 269–276, 1996.

    Google Scholar 

  3. A. Aziz, K. Sanwal, V. Singhal and R. Brayton. Model checking continuous time Markov chains. ACMT rans. on Computational Logic, 1(1): 162–170, 2000.

    Article  MathSciNet  Google Scholar 

  4. R.I. Bahar, E.A. Frohm, C.M. Gaona, G.D. Hachtel, E. Macii, A. Pardo and F. Somenzi. Algebraic decision diagrams and their applications. Formal Methods in System Design, 10(2/3): 171–206, 1997.

    Article  Google Scholar 

  5. C. Baier, E. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. In Automata, Languages and Programming, LNCS 1256: 430–440, 1997.

    Google Scholar 

  6. C. Baier, B.R. Haverkort, H. Hermanns and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In Computer Aided Verification, LNCS 1855: 358–372, 2000.

    Chapter  Google Scholar 

  7. C. Baier, J.-P. Katoen and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In Concurrency Theory, LNCS 1664: 146–162, 1999.

    Chapter  Google Scholar 

  8. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching-time logic with fairness. Distr. Comp., 11(3): 125–155, 1998.

    Article  Google Scholar 

  9. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Found. of Softw. Techn. and Th. Comp. Sc., LNCS 1026: 499–513, 1995.

    Google Scholar 

  10. K. Brace, R. Rudell and R. Bryant. Efficient implementation of a BDD package. In: 27th ACM/IEEE Design Automation Conference, 1990.

    Google Scholar 

  11. E. Clarke, E. Emerson and A. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACMT rans. on Progr. Lang. and Sys., 8: 244–263, 1986.

    Article  MATH  Google Scholar 

  12. E. Clarke, M. Fujita, P.C. McGeer and J.C-Y. Yang. Multi-terminal binary decision diagrams: an efficient data structure for matrix representation. In Formal Methods in System Design, 10(2/3): 149–169, 1997.

    Article  Google Scholar 

  13. E. Clarke, O. Grumberg and D. Long. Verification tools for finite-state concurrent programs. In A Decade of Concurrency, LNCS 803: 124–175, 1993.

    Google Scholar 

  14. L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker and R. Segala. Symbolic model checking for probabilistic processes using MTBDDs and the Kronecker representation. In Tools and Algorithms for the Analysis and Construction of Systems, LNCS 1785: 395–410, 2000.

    Chapter  Google Scholar 

  15. B.L. Fox and P.W. Glynn. Computing Poisson probabilities. Comm. of the ACM, 31(4): 440–445, 1988.

    Article  MathSciNet  Google Scholar 

  16. D. Gross and D.R. Miller. The randomization technique as a modeling tool and solution procedure for transient Markov chains. Oper. Res. 32(2): 343–361, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  17. H.A. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Form. Asp. of Comp., 6(5): 512–535, 1994.

    Article  MATH  Google Scholar 

  18. V. Hartonas-Garmhausen, S. Campos and E.M. Clarke. ProbVerus: probabilistic symbolic model checking. In Formal Methods for Real-Time and Prob. Sys., LNCS 1601: 96–111, 1999.

    Chapter  Google Scholar 

  19. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser and M. Siegle. A Markov chain model checker. In Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1785: 347–362, 2000.

    Chapter  Google Scholar 

  20. H. Hermanns, J. Meyer-Kayser and M. Siegle. Multi-terminal binary decision diagrams to represent and analyse continuous-time Markov chains. In Proc. 3rd Int. Workshop on the Num. Sol. of Markov Chains, pp. 188–207, 1999.

    Google Scholar 

  21. O.C. Ibe and K.S. Trivedi. Stochastic Petri net models of polling systems. IEEE J. on Sel. Areas in Comms., 8(9): 1649–1657, 1990.

    Article  Google Scholar 

  22. J. Kemeny, J. Snell and A. Knapp. Denumerable Markov Chains. Van Nostrand, 1966.

    Google Scholar 

  23. A. Jensen. Markov chains as an aid in the study of Markov processes. Skand. Aktuarietidskrift, 3: 87–91, 1953.

    Google Scholar 

  24. J.K. Muppala and K.S. Trivedi. Numerical transient solution of finite Markovian queueing systems. In U. Bhat, ed, Queueing and Related Models, Oxford University Press, 1992.

    Google Scholar 

  25. W.D. Obal II and W.H. Sanders. State-space support for path-based reward variables. Perf. Ev., 35: 233–251, 1999.

    Article  MATH  Google Scholar 

  26. D. Parker. Implementation of symbolic model checking for probabilistic systems. Ph.D thesis, School of Computer Science, University of Birmingham, 2001 (to appear).

    Google Scholar 

  27. F. Somenzi. CUDD: CU decision diagram package. Public software, Colorado University, Boulder, 1997.

    Google Scholar 

  28. W. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton Univ. Press, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Formal Methods and Tools Group, Faculty of Computer Science, University of Twente, P.O. Box217, 7500, AE Enschede, The Netherlands

    Joost-Pieter Katoen

  2. School of Computer Science, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK

    Marta Kwiatkowska, Gethin Norman & David Parker

Authors
  1. Joost-Pieter Katoen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marta Kwiatkowska
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gethin Norman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. David Parker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electr. and Computer Science, University of California at Berkeley, 479 Cory Hall, Berkeley, CA94720-1770, USA

    Luca de Alfaro

  2. Laboratory for Foundations of Computer Science, The University of Edinburgh, Edinburgh, EH9 3JZ, UK

    Stephen Gilmore

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Katoen, JP., Kwiatkowska, M., Norman, G., Parker, D. (2001). Faster and Symbolic CTMC Model Checking. In: de Alfaro, L., Gilmore, S. (eds) Process Algebra and Probabilistic Methods. Performance Modelling and Verification. PAPM-PROBMIV 2001. Lecture Notes in Computer Science, vol 2165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44804-7_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-44804-7_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42556-4

  • Online ISBN: 978-3-540-44804-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation