Skip to main content
SpringerLink
Log in

Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach

  • Conference paper
  • First Online:
Formal Methods for Real-Time and Probabilistic Systems (ARTS 1999)

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

Abstract

We describe the automata-theoretic approach to the algorithmic verification of probabilistic finite-state systems with respect to linear-time properties. The basic idea underlying this approach is that for any linear temporal formula we can construct an automaton that accepts precisely the computations that satisfy the formula. This enables the reduction of probabilistic model checking to ergodic analysis of Markov chains.

Supported in part by NSF grants CCR-9628400 and CCR-9700061, and by a grant from the Intel Corporation. URL: http://www.cs.rice.edu/~vardi.

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. C. Baier and M.Z. Kwiatowska. Automatic verification of liveness properties of randomized systems. In ACMSymp. on Principles of Distributed Systems (PODC), 1997.

    Google Scholar 

  2. J.R. Büchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method and Philos. Sci. 1960, pages 1–12, Stanford, 1962. Stanford University Press.

    Google Scholar 

  3. O. Bernholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In D. L. Dill, editor, Computer Aided Verification, Proc. 6th Int. Conference, volume 818 of Lecture Notes in Computer Science, pages 142–155, Stanford, June 1994. Springer-Verlag, Berlin.

    Chapter  Google Scholar 

  4. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, volume 131 of Lecture Notes in Computer Science, pages 52–71. Springer-Verlag, 1981.

    Google Scholar 

  5. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, January 1986.

    Article  MATH  Google Scholar 

  6. E.M. Clarke and O. Grumberg. Avoiding the state explosion problem in temporal logic model-checking algorithms. In Proc. 6th ACM Symposium on Principles of Distributed Computing, pages 294–303, Vancouver, British Columbia, August 1987.

    Google Scholar 

  7. E.M. Clarke, O. Grumberg, and D. Long. Verification tools for finite-state concurrent systems. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Decade of Concurrency — Reflections and Perspectives (Proceedings of REX School), volume 803 of Lecture Notes in Computer Science, pages 124–175. Springer-Verlag, 1993.

    Google Scholar 

  8. Y. Choueka. Theories of automata on ω-tapes: A simplified approach. Journal of Computer and System Sciences, 8:117–141, 1974.

    Article  MathSciNet  MATH  Google Scholar 

  9. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, 1990.

    Google Scholar 

  10. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275–288, 1992.

    Article  MATH  Google Scholar 

  11. C. Courcoubetis and M. Yannakakis. Markov decision processes and regular events. In Proc. 17th Int. Coll. on Automata Languages and Programming, volume 443, pages 336–349, Coventry, July 1990. Lecture Notes in Computer Science, Springer-Verlag.

    Chapter  Google Scholar 

  12. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. J. ACM, 42:857–907, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  13. C. Derman. Finite-State Markovian Decision Processes. Academic Press, New York, 1970.

    MATH  Google Scholar 

  14. E.A. Emerson and C. Jutla. Tree automata, Mu-calculus and determinacy. In Proc. 32nd IEEE Symposium on Foundations of Computer Science, pages 368–377, San Juan, October 1991.

    Google Scholar 

  15. E.A. Emerson. Automata, tableaux, and temporal logics. In Proc. Workshop on Logic of Programs, volume 193 of Lecture Notes in Computer Science, pages 79–87. Springer-Verlag, 1985.

    Chapter  Google Scholar 

  16. N. Francez. Fairness. Texts and Monographs in Computer Science. Springer-Verlag, 1986.

    Google Scholar 

  17. D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proc. 7th ACM Symposium on Principles of Programming Languages, pages 163–173, January 1980.

    Google Scholar 

  18. H. Hansson and B. Jonsson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6:512–535, 1994.

    Article  MATH  Google Scholar 

  19. D. Harel and A. Pnueli. On the development of reactive systems. In K. Apt, editor, Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 477–498. Springer-Verlag, 1985.

    Google Scholar 

  20. S. Hart, M. Sharir, and A. Pnueli. Termination of probabilistic concurrent programs. ACM Trans. on Programming Languages, 5:356–380, 1983.

    Article  MATH  Google Scholar 

  21. N. Klarlund. Progress measures for complementation of ω-automata with applications to temporal logic. In Proc. 32nd IEEE Symposium on Foundations of Computer Science, pages 358–367, San Juan, October 1991.

    Google Scholar 

  22. J.G. Kemeny and J.L. Snell. Finite Markov Chains. Van Nostrad, Princeton, 1960.

    MATH  Google Scholar 

  23. J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. Springer-Verlag, New York, 1976.

    Book  MATH  Google Scholar 

  24. R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.

    Google Scholar 

  25. O. Kupferman and M.Y. Vardi. Synthesis with incomplete informatio. In 2nd International Conference on Temporal Logic, pages 91–106, Manchester, July 1997. Kluwer Academic Publishers.

    Google Scholar 

  26. O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. In Proc. 5th Israeli Symposium on Theory of Computing and Systems, pages 147–158. IEEE Computer Society Press, 1997.

    Google Scholar 

  27. M.T. Liu. Protocol engineering. Advances in Computing, 29:79–195, 1989.

    Article  Google Scholar 

  28. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proc. 12th ACM Symposium on Principles of Programming Languages, pages 97–107, New Orleans, January 1985.

    Google Scholar 

  29. D. Lehman and M. O. Rabin. On the advantage of free choice: A fully symmetric and fully distributed solution to the dining philosophers problem. In Proc. 8th ACM Symposium on Principles of Programming Languages, pages 133–138, 1981.

    Google Scholar 

  30. R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521–530, 1966.

    Article  MathSciNet  MATH  Google Scholar 

  31. M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.

    Google Scholar 

  32. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science, pages 46–57, 1977.

    Google Scholar 

  33. A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45–60, 1981.

    Article  MathSciNet  MATH  Google Scholar 

  34. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th International Symp. on Programming, volume 137, pages 337–351. Springer-Verlag, Lecture Notes in Computer Science, 1981.

    Google Scholar 

  35. H. Rudin. Network protocols and tools to help produce them. Annual Review of Computer Science, 2:291–316, 1987.

    Article  Google Scholar 

  36. S. Safra. Complexity of automata on infinite objects. PhD thesis, Weizmann Institute of Science, Rehovot, Israel, 1989.

    Google Scholar 

  37. A.P. Sistla and E.M. Clarke. The complexity of propositional linear temporal logic. Journal ACM, 32:733–749, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  38. S. Safra and M.Y. Vardi. On ω-automata and temporal logic. In Proc. 21st ACM Symposium on Theory of Computing, pages 127–137, Seattle, May 1989.

    Google Scholar 

  39. W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165–191, 1990.

    Google Scholar 

  40. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. 26th IEEE Symp. on Foundations of Computer Science, pages 327–338, Portland, October 1985.

    Google Scholar 

  41. M.Y. Vardi. Alternating automata and program verification. In Computer Science Today-Recent Trends and Developments, volume 1000 of Lecture Notes in Computer Science, pages 471–485. Springer-Verlag, Berlin, 1995.

    Google Scholar 

  42. M.Y. Vardi. An automata-theoretic approach to linear temporal logic. In F. Moller and G. Birtwistle, editors, Logics for Concurrency: Structure versus Automata, volume 1043 of Lecture Notes in Computer Science, pages 238–266. Springer-Verlag, Berlin, 1996.

    Chapter  Google Scholar 

  43. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. First Symposium on Logic in Computer Science, pages 322–331, Cambridge, June 1986.

    Google Scholar 

  44. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1–37, November 1994.

    Article  MathSciNet  MATH  Google Scholar 

  45. P. Wolper. Temporal logic can be more expressive. Information and Control, 56(1–2):72–99, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  46. P. Wolper. On the relation of programs and computations to models of temporal logic. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Proc. Temporal Logic in Specification, volume 398, pages 75–123. Lecture Notes in Computer Science, Springer-Verlag, 1989.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rice University, Houston, TX, 77005-1892, USA

    Moshe Y. Vardi

Authors
  1. Moshe Y. Vardi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lehrstuhl für Informatik, University of Erlangen-Nürnberg, Martensstr. 3, D-91058, Erlangen, Germany

    Joost-Pieter Katoen

  2. Formal Methods and Tools Group, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Joost-Pieter Katoen

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vardi, M.Y. (1999). Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach. In: Katoen, JP. (eds) Formal Methods for Real-Time and Probabilistic Systems. ARTS 1999. Lecture Notes in Computer Science, vol 1601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48778-6_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-48778-6_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66010-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation