On probabilistic computation tree logic

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

Volumn 2925, Issue , 2004, Pages 147-188

  Ciesinski, Frank ^a   Größer, Marcus ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Discrete time Markov chains; Fairness; Markov decision processes; PCTL; PCTL*; Probabilistic deterministic systems; Probabilistic nondeterministic systems; Quantitative model checking; Scheduler

Indexed keywords

COMPUTER CIRCUITS; FORESTRY; MARKOV CHAINS;

DETERMINISTIC SYSTEMS; DISCRETE TIME MARKOV CHAINS; FAIRNESS; MARKOV DECISION PROCESSES; NONDETERMINISTIC SYSTEMS; PCTL; QUANTITATIVE MODEL CHECKING; SCHEDULER;

MODEL CHECKING;

EID: 34250190790     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24611-4_5     Document Type: Article

References (51)

1. Alur and Dill. A theory of timed automata. Theoretical Computer Science, pages 183-235, 1994.
2. Rajeev Alur, Costas Courcoubetis, and David L. Dill. Model-checking for probabilistic real-time systems (extended abstract). In Javier Leach Albert, Burkhard Monien, and Mario Rodríguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 115-126, Madrid, Spain, 8-12 July 1991. Springer-Verlag.
3. A. Aziz, V. Singhal, F. Balarin, and R. K. Brayton. It usually works: The temporal logic of stochastic systems. Lecture Notes in Computer Science, 939:155-165, 1995.
4. C. Baier. On algorithmic verification methods for probabilistic systems (habilitation thesis). November 1998.
5. C. Baier, J.-P. Katoen, and H. Hermanns. Approximate symbolic model checking of continuous-time markov chains. Lecture Notes in Computer Science, 10th International Conference on Concurrency Theory, CONCUR'99, 1664:146-161, 1999.
6. Christel Baier, Edmund M. Clarke, Vassili Hartonas-Garmhausen, Marta Z. Kwiatkowska, and Mark Ryan. Symbolic model checking for probabilistic processes. In Pierpaolo Degano, Robert Gorrieri, and Alberto Marchetti-Spaccamela, editors, Automata, Languages and Programming, 24th International Colloquium, volume 1256 of Lecture Notes in Computer Science, pages 430-440, Bologna, Italy, 7-11 July 1997. Springer-Verlag.
7. Beauquier and Slissenko. Polytime model checking for timed probabilistic computation tree logic. Acta Informatica 35, pages 645-664, 1998.
8. Danièle Beauquier and Anatol Slissenko. Polytime model checking for timed probabilistic computation tree logic. Acta Informatica, 35(8):645-664, 1998.
9. A. Bianco and L. De Alfaro. Model checking of probabilistic and nondeterministic systems. Lecture Notes in Computer Science, 1026:499-513, 1995.
10. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11, 1998.
11. E. M. Clarke, E. Allen Emerson, and A. P. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
12. Edmund M. Clarke, Orna Grumberg, and Doron A. Peled. Model Checking. The MIT Press, 1999.
13. Costas Courcoubetis and Mihalis Yannakakis. Verifying temporal properties of finite-state probabilistic programs. In 29th Annual Symposium on Foundations of Computer Science, pages 338-345, White Plains, New York, 24-26 October 1988. IEEE.
14. Costas Courcoubetis and Mihalis Yannakakis. Markov decision processes and regular events (extended abstract). In Michael S. Paterson, editor, Automata, Languages and Programming, 17th International Colloquium, volume 443 of Lecture Notes in Computer Science, pages 336-349, Warwick University, England, 16-20 July 1990. Springer-Verlag.
15. Costas Courcoubetis and Mihalis Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, July 1995.
16. P.R. D'Argenio, B. Jeannet, H.E. Jensen, and K.G. Larsen. Reduction and refinement strategies for probabilistic analysis. In H. Hermanns and R. Segala, editors, Proceedings of Process Algebra and Probabilistic Methods. Performance Modeling and Verification. Joint International Workshop, PAPM-PROBMIV 2001, Copenhagen, Denmark, Lecture Notes in Computer Science. Springer-Verlag, 2001.
17. L. De Alfaro. Temporal logics for the specification of performance and reliability. Lecture Notes in Computer Science, 1200:165-??, 1997.
18. Luca de Alfaro. Formal verification of probabilistic systems. Thesis CS-TR-98-1601, Stanford University, Department of Computer Science, June 1998.
19. Emerson, Mok, Sistla, and Srinivasan. Quantitative temporal reasoning. In Journal of Real Time System, pages 331-352, 1992.
20. E. A. Emerson and J. Y. Halpern. 'Sometimes' and 'not never' revisited: on branching time versus linear time temporal logic. Journal of the ACM, 33(1):151-178, 1986.
21. E. Allen Emerson. Temporal and modal logic. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pages 995-1072. Elsevier Science Publishers, Amsterdam, The Netherlands, 1990.
22. W. Feller. An Intro. to Probability Theory and its application. John Wiley and Sons, New York, 1968.
23. H. Hansson. Time and Probability in Formal Design of Distributed Systems. Series in Real-Time Safety Critical Systems. Elsevier, 1994.
24. H. Hansson and B. Jonsson. A calculus for communicating systems with time and probabitilies. In IEEE Computer Society Press, editor, Proceedings of the Real-Time Systems Symposium - 1990, pages 278-287, Lake Buena Vista, Florida, USA, December 1990. IEEE Computer Society Press.
25. Hans Hansson and Bengt Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512-535, 1994.
26. Hans A. Hansson. Time and probability in formal design of distributed systems. SICS Dissertation Series 05, Swedish Institute of Computer Science, Box 1263, S-164 28 Kista, Sweden, 1994.
27. Sergiu Hart, Micha Sharir, and Amir Pnueli. Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems (TOPLAS), 5(3):356-380, July 1983.
28. R. Jagadeesan J. Desharnais, V. Gupta and P. Panangaden. Weak bisimulation is sound and complete for pctl*. Lecture Notes in Computer Science, 2421:355-370, 2002.
29. Bengt Jonsson and Kim Guldstrand Larsen. Specification and refinement of probabilistic processes. In Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, pages 266-277, Amsterdam, The Netherlands, 15-18 July 1991. IEEE Computer Society Press.
30. Chi-Chang Jou and Scott A. Smolka. Equivalences, congruences, and complete axiomatizations for probabilistic processes. In J. C. M. Baeten and J. W. Klop, editors, CONCUR '90: Theories of Concurrency: Unification and Extension, volume 458 of Lecture Notes in Computer Science, pages 367-383, Amsterdam, The Netherlands, 27-30August 1990. Springer-Verlag.
31. K. Larsen K and A. Skou. Bisimulation through probabilistic testing. Inf Comput 94, pages 1-28, 1991.
32. J.G. Kemeny and J.L. Snell. Finite Markov Chains. Princeton University Press, 1960.
33. Marta Kwiatkowska, Gethin Norman, Roberto Segala, and Jeremy Sproston. Automatic verification of real-time systems with discrete probability distributions. Lecture Notes in Computer Science, 1601:75-95, 1999.
34. Marta Kwiatkowska, Gethin Norman, Roberto Segala, and Jeremy Sproston. Verifying quantitative properties of continuous probabilistic timed automata. Lecture Notes in Computer Science, 1877, 2000.
35. Marta Kwiatkowska, Gethin Norman, and Jeremy Sproston. Probabilistic model checking of the ieee 802.11 wireless local area network protocol. Process Algebra and Probabilistic Methods, Performance Modeling and Verification, Second Joint International Workshop PAPM-PROBMIV 2002, Copenhagen, Denmark, July 25-26, 2002, Proceedings, LNCS 2399:169-187, 2002.
36. Marta Z. Kwiatkowska, Gethin Norman, and David Parker. PRISM: Probabilistic symbolic model checker. In Computer Performance Evaluation / TOOLS, pages 200-204, 2002.
37. Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer, New York, 1992.
38. K. L. McMillan. Symbolic Model Checking. PhD thesis, Carnegie Mellon University, Pittsburgh, 1993.
39. A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Distributed Computing, 1:53-72, 1986.
40. Amir Pnueli and Lenore Zuck. Probabilistic verification by tableaux. In Proceedings, Symposium on Logic in Computer Science, pages 322-331, Cambridge, Massachusetts, 16-18 June 1986. IEEE Computer Society.
41. Amir Pnueli and Lenore D. Zuck. Probabilistic verification. Information and Computation, 103(1):1-29, March 1993.
42. Martin L. Puterman. Markov Decision Processes - Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York, NY, 1994.
43. Shmuel Safra. On the complexity of ω-automata. In 29th Annual Symposium on Foundations of Computer Science, pages 319-327, White Plains, New York, 24-26 October 1988. IEEE.
44. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1995. Available as Technical Report MIT/LCS/TR-676.
45. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Lecture Notes in Computer Science, 836:481-496, 1994.
46. Roberto Segala and Nancy Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, Summer 1995.
47. Wolfgang Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 4, pages 133-191. Elsevier Science Publishers B. V., 1990.
48. S. Campos V. Hartonas-Garmhausen and E. Clarke. Probverus: Probabilistic symbolic model checking. Lecture Notes in Computer Science, 1601:96-110, 1999.
49. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In 26th Annual Symposium on Foundations of Computer Science, pages 327-338, Los Angeles, Ca., USA, October 1985. IEEE Computer Society Press.
50. Moshe Y. Vardi. Probabilistic linear-time model checking: An overview of the automata-theoretic approach. Lecture Notes in Computer Science, 1601:265-276, 1999.
51. Moshe Y. Vardi and Pierre Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In Proceedings, Symposium on Logic in Computer Science, pages 332-344, Cambridge, Massachusetts, 16-18 June 1986. IEEE Computer Society.