Probabilistic linear-time model checking: An overview of the automata-theoretic approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1601, Issue , 1999, Pages 265-276

  Vardi, Moshe Y ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATA THEORY; FORMAL METHODS; MARKOV PROCESSES; REAL TIME SYSTEMS;

ALGORITHMIC VERIFICATION; AUTOMATA-THEORETIC APPROACH; ERGODICS; FINITE STATE SYSTEMS; LINEAR-TIME MODEL-CHECKING; LINEAR-TIME PROPERTIES; PROBABILISTIC MODEL CHECKING; TEMPORAL FORMULAE;

MODEL CHECKING;

EID: 84957708709     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48778-6_16     Document Type: Conference Paper

References (46)

1. [BK97] C. Baier and M.Z. Kwiatowska. Automatic verification of liveness properties of randomized systems. In ACM Symp. on Principles of Distributed Systems (PODC), 1997.
2. [Büc62] 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.
3. [BVW94] 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.
4. [CE81] 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.
5. [CES86] E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACMTransactions on Programming Languages and Systems, 8(2):244-263, January 1986.
6. [CG87] 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.
7. [CGL93] 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.
8. [Cho74] Y. Choueka. Theories of automata on ω-tapes: A simplified approach. Journal of Computer and System Sciences, 8:117-141, 1974.
9. [CLR90] T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, 1990.
10. [CVWY92] 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.
11. [CY90] 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.
12. [CY95] C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. J. ACM, 42:857-907, 1995.
13. [Der70] C. Derman. Finite-State Markovian Decision Processes. Academic Press, New York, 1970.
14. [EJ91] 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.
15. [Eme85] E.A. Emerson. Automata, tableaux, and temporal logics. In Proc. Workshop on Logic ofPrograms, volume 193 of Lecture Notes in Computer Science, pages 79-87. Springer-Verlag, 1985.
16. [Fra86] N. Francez. Fairness. Texts and Monographs in Computer Science. Springer-Verlag, 1986.
17. [GPSS80] 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.
18. [HJ94] H. Hansson and B. Jonsson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6:512-535, 1994.
19. [HP85] 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.
20. [HSP83] S. Hart, M. Sharir, and A. Pnueli. Termination of probabilistic concurrent programs. ACM Trans. on Programming Languages, 5:356-380, 1983.
21. [Kla91] 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.
22. [KS60] J.G. Kemeny and J.L. Snell. Finite Markov Chains. Van Nostrad, Princeton, 1960.
23. [KSK76] J.G. Kemeny, J.L. Snell, and A.W. Knapp. DenumerableMarkov Chains. Springer-Verlag, New York, 1976.
24. [Kur94] R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
25. [KV97a] 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.
26. [KV97b] 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.
27. [Liu89] M.T. Liu. Protocol engineering. Advances in Computing, 29:79-195, 1989.
28. [LP85] 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.
29. [LR81] 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.
30. [McN66] R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521-530, 1966.
31. [Mic88] M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
32. [Pnu77] A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science, pages 46-57, 1977.
33. [Pnu81] A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45-60, 1981.
34. [QS81] 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.
35. [Rud87] H. Rudin. Network protocols and tools to help produce them. Annual Review of Computer Science, 2:291-316, 1987.
36. [Saf89] S. Safra. Complexity of automata on infinite objects. PhD thesis, Weizmann Institute of Science, Rehovot, Israel, 1989.
37. [SC85] A.P. Sistla and E.M. Clarke. The complexity of propositional linear temporal logic. Journal ACM, 32:733-749, 1985.
38. [SV89] 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.
39. [Tho90] W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165-191, 1990.
40. [Var85] 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.
41. [Var95] 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.
42. [Var96] 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.
43. [VW86] 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.
44. [VW94] M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1): 1-37, November 1994.
45. [Wol83] P. Wolper. Temporal logic can be more expressive. Information and Control, 56(1-2):72-99, 1983.
46. [Wol89] 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.