Bounded probabilistic model checking with the murφ verifier

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

Volumn 3312, Issue , 2004, Pages 214-229

  Penna, Giuseppe Della ^a   Intrigua, Benedetto ^a   Melatti, Igor ^a   Tronci, Enrico ^b   Zilli, Marisa Venturini ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHAINS; COMPUTER AIDED DESIGN; FORMAL METHODS; HYBRID SYSTEMS; MARKOV PROCESSES; PRISMS;

ARITHMETIC OPERATIONS; FINITE HORIZONS; PROBABILISTIC MODEL CHECKING; PROBABILISTIC SYSTEMS; STATE OF THE ART; STATE VARIABLES; SYMBOLIC MODEL CHECKERS; VERIFICATION ALGORITHMS;

MODEL CHECKING;

EID: 35048902404     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (34)

1. C. Baier, E. M. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. In Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela, editors, ICALP'97, Proceedings, volume 1256 of LNCS, pages 430-440. Springer, 1997.
2. E. Behrends. Introduction to Markov Chains. Vieweg, 2000.
3. Bianco and de Alfaro. Model checking of probabilistic and nondeterministic systems. In P. S. Thiagarajan, editor, Foundations of Software Technology and Theoretical Computer Science, 15th Conference, Bangalore, India, December 18-20, 1995, Proceedings, volume 1026 of LNCS, pages 499-513. Springer, 1995.
4. R. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans, on Computers, C-35(8):677-691, Aug 1986.
5. 20 states and beyond. Inf. Comput., 98(2):142-170, 1992.
6. Cached murphi web page: http://www.dsi.uniromal.it/~tronci/cached.murphi. html.
7. 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 Proceedings of the 30th international on Design automation conference, pages 54-60. ACM Press, 1993.
8. C. Courcoubetis and M. Yannakakis. Verifying temporal properties of finite-state probabilistic programs. In Proceedings of the IEEE Conference on Decision and Control, pages 338-345, Piscataway, NJ, 1988. IEEE Press.
9. Costas Courcoubetis and Mihalis Yannakakis. The complexity of probabilistic verification. J. ACM, 42(4):857-907, 1995.
10. Cudd web page: http://vlsi.colorado.edu/~fabio/.
11. L. de Alfaro. Formal verification of performance and reliability of real-time systems. Technical Report STAN-CS-TR-96-1571, Stanford University, 1996.
12. David L. Dill, Andreas J. Drexler, Alan J. Hu, and C. Han Yang. Protocol verification as a hardware design aid. In Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors, pages 522-525. IEEE Computer Society, 1992.
13. Online appendices: http://www.di.univaq.it/melatti/FMCAD04/.
14. B. Jonsson H. Hansson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6(5):512-535, 1994.
15. H. Hansson. Time and Probability in Formal Design of Distributed Systems. Elsevier, 1994.
16. Sergiu Hart and Micha Sharir. Probabilistic temporal logics for finite and bounded models. In Proceedings of the sixteenth annual ACM symposium on Theory of computing, pages 1-13. ACM Press, 1984.
17. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle. A tool for model-checking markov chains. Software Tools for Technology Transfer, 4(2):153-172, Feb 2003.
18. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, New Jersey, 1991.
19. G. J. Holzmann. The spin model checker. IEEE Trans, on Software Engineering, 23(5):279-295, May 1997.
20. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In Tony Field, Peter G. Harrison, Jeremy T. Bradley, and Uli Harder, editors, TOOLS 2002, Proceedings, volume 2324 of LNCS, pages 200-204. Springer, 2002.
21. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: A hybrid approach. In Joost-Pieter Katoen and Perdita Stevens, editors, TAG AS 2002, Held as Part of ETAPS 2002, Proceedings, volume 2280 of LNCS, pages 52-66. Springer, 2002.
22. Kim G. Larsen and Arne Skou. Bisimulation through probabilistic testing. Inf. Comput., 94(1):1-28, 1991.
23. D. Lehmann and M. Rabin. On the advantages of free choice: A symmetric fully distributed solution to the dining philosophers problem (extended abstract). In Proc. 8th Symposium on Principles of Programming Languages, pages 133-138, 1981.
24. N. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. In Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, pages 314-323. ACM Press, 1994.
25. Murphi web page: http://sprout.stanford.edu/dill/murphi.html.
26. G. Della Penna, B. Intrigila, I. Melatti, M. Minichino, E. Ciancamerla, A. Parisse, E. Tronci, and M. V. Zilli. Automatic verification of a turbogas control system with the murφ verifier. In Oded Maler and Amir Pnueli, editors, HSCC 2003 Proceedings, volume 2623 of LNCS, pages 141-155. Springer, 2003.
27. G. Della Penna, B. Intrigila, I. Melatti, E. Tronci, and M. V. Zilli. Finite horizon analysis of markov chains with the rnurφ verifier. In Daniel Geist and Enrico Tronci, editors, CHARME 2003, Proceedings, volume 2860 of LNCS, pages 394-409. Springer, 2003.
28. G. Della Penna, B. Intrigila, I. Melatti, E. Tronci, and M. V. Zilli. Finite horizon analysis of stochastic systems with the murφ verifier. In Carlo Blundo and Cosimo Laneve, editors, ICTCS 2003, Proceedings, volume 2841 of LNCS, pages 58-71. Springer, 2003.
29. A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Distrib. Comput., 1(1):53-72, 1986.
30. Prism web page: http://www.cs.bham.ac.uk/~dxp/prism/.
31. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In Bengt Jonsson and Joachim Parrow, editors, CONCUR '94, Proceedings, volume 836 of LNCS, pages 481-196. Springer, 1994.
32. Spin web page: http://spinroot.com.
33. M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In 26th Annual Symposium on Foundations of Computer Science, pages 327-338, Portland, Oregon, Oct 1985. IEEE CS Press.
34. E. M. Clarke V. Hartonas-Garmhausen, S. V. Aguiar Campos. Probverus: Probabilistic symbolic model checking. In Joost-Pieter Katoen, editor, ARTS'99, Proceedings, volume 1601 of LNCS, pages 96-110. Springer, 1999.