Symbolic model checking of probabilistic processes using MTBDDs and the Kronecker representation

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

Volumn 1785 LNCS, Issue , 2000, Pages 395-410

  De Alfaro, Luca ^a   Kwiatkowska, Marta ^b   Norman, Gethin ^b   Parker, David ^b   Segala, Roberto ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; PROBABILITY DISTRIBUTIONS; ALGORITHMS;

EXPERIMENTAL MODELING; KRONECKER REPRESENTATIONS; MULTI-TERMINAL BINARY DECISION DIAGRAMS; NONDETERMINISTIC CHOICE; PROBABILISTIC FAILURE; PROBABILISTIC PROCESS; PROBABILISTIC SYSTEMS; SYMBOLIC MODEL CHECKING;

MODEL CHECKING;

EID: 84863969632     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46419-0_27     Document Type: Conference Paper

References (32)

1. I. Bahar, E. Frohm, C. Gaona, G. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic Decision Diagrams and their Applications. Journal of Formal Methods in Systems Design, 10(2/3):171-206, 1997. (Pubitemid 127506986)
2. C. Baier. On algorithmic verification methods for probabilistic systems. Habilitation thesis, 1998.
3. C. Baier, E. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. In Proceedi ngs, 24th ICALP, Volume 1256 of LNCS, pages 430-440. Springer-Verlag, 1997. (Pubitemid 127097759)
4. C. Baier, J.-P. Katoen, and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In CONCUR'99, Volume 1664 of LNCS, pages 146-161. Springer-Verlag, 1999.
5. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11:125-155, 1998. (Pubitemid 128492665)
6. J. Bengtsson, K. G. Larsen, F. Larsson, P. Pettersson, W. Yi, and C. Weise. New generation of uppaal. In Proceedings of the International Workshop on Software Tools for Technology Transfer, Aalborg, Denmark, July 1998.
7. D. Bertsekas. Dynamic Programming and Optimal Control. Athena Scientific, 1995.
8. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proceedings, FST & TCS, Volume 1026 of LNCS, pages 499-513. Springer-Verlag, 1995. (Pubitemid 126012732)
9. M. Bozga and O. Maler. On the representation of probabilities over structured domains. In Proc. CAV'99, 1999. Available as Volume 1633 of LNCS.
10. 20 states and beyond. In LICS'90, June 1990.
11. G. Ciardo and A. Miner. SMART: Simulation and markovian analyzer for reliability and timing. In Tools Descriptions from PNPM'97, pages 41-43, 1997.
12. G. Ciardo and A. Miner. A data structure for the efficient Kronecker solution of GSPNs. In Proc. PNPM'99, 1999.
13. E. Clarke, E. Emerson, and A. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. In Proceedings, 10th Annual Symp. on Principles of Programming Languages, 1983.
14. E. Clarke, M. Fujita, P. McGeer, J. Yang, and X. Zhao. Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation. In International Workshop on Logic Synthesis, 1993.
15. C. Courcoubetis and M. Yannakakis. Markov decision processes and regular events. In Proc. ICALP'90, Volume 443 of LNCS, pages 336-349. Springer-Verlag, 1990.
16. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
17. L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proc. LICS'98, pages 454-465, 1998.
18. L. de Alfaro. Stochastic transition systems. In Proc. CONCUR'98, Volume 1466 of LNCS. Springer-Verlag, 1998.
19. L. de Alfaro. Computing minimum and maximum reachability times in probabilistic systems. In Proc. CONCUR'99, Volume 1664 of LNCS, 1999.
20. L. de Alfaro. From fairness to chance. In Proc. PROBMIV'98, Volume 21 of ENTCS. Elsevier, 1999.
21. G. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Markovian Analysis of Large Finite State Machines. IEEE Transactions on CAD, 15(12):1479-1493, 1996. (Pubitemid 126780410)
22. H. Hansson and B. Jonsson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6:512-535, 1994.
23. H. Hermanns, J. Meyer-Kayser, and M. Siegle. Multi Terminal Binary Decision Diagrams to represent and analyse continuous time Markov chains. In Proc. NSMC'99, 1999.
24. M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic model checking of concurrent probabilistic systems using MTBDDs and simplex. Technical Report CSR-99-1, University of Birmingham, 1999.
25. K. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
26. B. Plateau. On the Stochastic Structure of Parallelism and Synchronisation Models for Distributed Algorithms. In Proc. 1985 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 147-153, May 1985.
27. B. Plateau, J. M. Fourneau, and K. H. Lee. PEPS: a package for solving complex Markov models of parallel systems. In R. Puigjaner and D. Potier, editors, Modelling techniques and tools for computer performance evaluation, 1988.
28. A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Distributed Computing, 1:53-72, 1986.
29. R. Segala. Modelling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995.
30. M. Siegle. Compact representation of large performability models based on extended BDDs. In Fourth International Workshop on Performability Modeling of Computer and Communication Systems (PMCCS4), pages 77-80, 1998.
31. F. Somenzi. CUDD: CU decision diagram package. Public software, Colorado University, Boulder, 1997.
32. M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings, FOCS' 85, pages 327-338. IEEE Press, 1987.