Symbolic model checking for probabilistic processes

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

Volumn 1256, Issue , 1997, Pages 430-440

  Baier, Christel ^a   Clarke, Edmund M ^b   Hartonas Garmhausen, Vasiliki ^b   Kwiatkowska, Marta ^c   Ryan, Mark ^c  

^a UNIVERSITY OF MANNHEIM   (Germany)

^b Carnegie Mellon University   (United States)

^c UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BINARY DECISION DIAGRAMS; LINEAR EQUATIONS; MARKOV PROCESSES; PROBABILISTIC LOGICS;

EXPLICIT STATE; LINEAR EQUATION SYSTEM; MODEL CHECKER; MULTI-TERMINAL BINARY DECISION DIAGRAMS; PROBABILISTIC COMPUTATION TREE LOGIC; PROBABILISTIC PROCESS; SYMBOLIC MODEL CHECKING;

MODEL CHECKING;

EID: 84951056897     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_199     Document Type: Conference Paper

References (35)

1. R Alur, C. Courcoubetis, D. Dill. Verifying Automata Specifications of Probabilistic Real-Time Systems. In Proc. Real-Time: Theory and Practice, LNCS 600, pp 27-44, Springer, 1991.
2. L. de Alfaro. Formal Verification of Performance and Reliability of Real-Time Systems. Techn. Report, Stanford University, 1996.
3. C. Baier. Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation. In Proc. CAV'96, LNCS 1102, pp 38-49, Springer, 1996.
4. C. Baier, S. Campos, E. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, M. Minea, and M. Ryan. Probabilistic model checking using multi terminal binary decision diagrams. In preparation.
5. C. Baier, M. Kwiatkowska. Model Checking for a Probabilistic Branching Time Logic with Fairness. Techn. Report CSR-96-12, University of Birmingham, 1996.
6. A. Bianco, L. de Alfaro. Model Checking of Probabilistic and Nondeterministic Systems. In Proc. Foundations of Software Technology and Theoretical Computer Science, LNCS 1026, pp 499-513, Springer, 1995.
7. R. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, 35(8), pp 677-691, 1986.
8. J. Bureh, E. Clarke, K. McMillan, D. Dill, L. Hwang. Symbolic Model Checking: 1020 States and Beyond. Information and Computation, 98(2), pp 342-170, 1992.
9. S. V. Campos, E. M. Clarke, W. Marrero, and M. Minea. Verus: a tool for quantitative analysis of finite-state real-time systems. In Proc. Workshop on Languages, Compilers and Tools for Real-Time Systems, 1995.
10. E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In D. Kozen, eds, Proc. Logic of Programs, LNCS 131, Springer, 1981.
11. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications: A practical approach. In Proc. 10th Annual Symp. of Programming Languages, 1983.
12. É. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Programming Lnaguages and Systems, 1(2), 1986.
13. E. Clarke, M. Fujita, P. McGeer, J Yang, and X. Zhao. Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. In IWLS '93: International Workshop on Logic Synthesis, Tahoe City, May 1993.
14. E. Clarke, M. Fujita, X Zhao. Multi-Terminal Binary Decision Diagrams and Hybrid Decision Diagrams. In T. Sasao and M. Fujita, eds, Representations of Discrete Functions, pp 93-108, Kiuwer Academic Publishers, 1996.
15. E. Clarke, O. Grumberg, D. Long. Verfication Tools for Finite-State Concurrent Programs. In Proc. A Decade of Concurrency, LNCS 803, pp 124-175, Springer, 1993.
16. E. M. Clarke, K. L. McMillan, X. Zhao, M. Fujita, and J. Yang. Spectral transforms for large boolean functions with applications to technology mapping. In Proc. 30th ACM/IEEE Design Automation Conference, pp 54-60, IEEE, 1993.
17. C. Courcoubetis, M. Yannakakis. Verifying Temporal Properties of Finite-State Probabilistic Programs. In Proc. FOCS'88, pp 338-345, IEEE, 1988.
18. C. Courcoubetis, M. Yannakakis. The Complexity of Probabilistic Verification. J. ACM, 42(4), pp 857-907, 1995.
19. R. Enders, T. Filkom, D. Taubner. Generating BDDs for Symbolic Model Checking in CCS. Distributed Computing, 6, 1993.
20. P. Halmos. Measure Theory, Springer, 1950.
21. S. Hart, M. Sharir. Probabilistic Temporal Logic for Finite and Bounded Models. In Proc. 16th ACM Symposium on Theory of Computing, pp 1-13, 1984.
22. S. Hart, M. Sharir, A. Pnueli. Termination of Probabilistic Concurrent Programs. ACM Trans. Programming Languages and Systems, 5, pp 356-380, 1983.
23. H. Hansson. Time and Probability in Formal Design of Distributed Systems, Elsevier, 1994.
24. H. Hansson, B. Jonsson. A Logic for Reasoning about Time and Probability. Formal Aspects of Computing, 6, pp 512-535, 1994.
25. M. Huth, M. Kwiatkowska. Quantitative Analysis and Model Checking, In Proc. L1CS'97, IEEE Computer Society Press, 1997.
26. D. Kozen. A Probabilistic PDL, JCSS, 30(2), pp 162-178,1985.
27. K. Larsen, A. Skou. Bisimulation through Probabilistic Testing. Information and Computation, 94, pp 1-28, 1991.
28. K. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem, Kiuwer Academic Publishers, 1993.
29. A. Pnueli, L. Zuck. Verification of Multiprocess Probabilistic Protocols. Distributed Computing, 1(1), pp 53-72,1986.
30. A. Pnueli, L. Zuck. Probabilistic Verification. Information and Computation, 103, pp 1-29, 1993.
31. R. Segala, N. Lynch. Probabilistic Simulations for Probabilistic Processes. In Proc. CONCUR, LNCS 836, pp 481-496, Springer, 1994.
32. K. Seidel C. Morgan, A. McLver and J.W. Sanders Probabilistic Predicate Transformers. Techn. Report PRG-TR-4-95, Oxford University Computing Laboratory, 1995.
33. W. Thomas. Automata on Infinite Objects. In Handbook of Theoretical Computer Science, Vol. 8, pp 135-191, North-Holland, 1990.
34. M. Vardi. Automatic Verification of Probabilistic Concurrent Finite-State Programs. In Proc. FOCS'85, pp 327-338, IEEE, 1985.
35. M. Vardi, P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification, In Proc. LICS'86, pp 332-344, IEEE Computer Society Press, 1986.