Finite horizon analysis of Markov chains with the Murφ verifier

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

Volumn 2860, Issue , 2003, Pages 394-409

  Della Penna, Giuseppe ^a   Intrigila, 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; DESIGN; HYBRID SYSTEMS; MODEL CHECKING; PRISMS;

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

MARKOV PROCESSES;

EID: 0142152284     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39724-3_34     Document Type: Article

References (32)

1. C. Baier, E. M. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. Automata, Languages and Programming, pages 430-440, 1997.
2. E. Behrends. Introduction to Markov Chains. Vieweg, 2000.
3. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. Foundations of Software Technology and Theoretical Computer Science, 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), Aug 1986.
5. 20 states and beyond. Information and Computation, 98, 1992.
6. E. M. Clarke, K. L. McMillan, X. Zhao, M. Fujita, and J. Yang. Spectral transforms for large boolean functions with applications to technology mapping. Proc. 30th ACM/IEEE Design Automation Conference, pages 54-60, 1993.
7. url: http://vlsi.colorado.edu/∼fabio/.
8. C. Courcoubetis and M. Yannakakis. Verifying temporal properties of finite-state probabilistic programs. In Proc. of FOCS'88, pages 338-345. IEEE CS Press, 1988.
9. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. J. ACM, 42(4):857-907, 1995.
10. L. de Alfaro. Formal verification of performance and reliability of real-time systems. Technical report, Stanford University, 1996.
11. D. L. Dill, A. J. Drexler, A. J. Hu, and C. H. Yang. Protocol verification as a hardware design aid. In IEEE International Conference on Computer Design: VLSI in Computers and Processors, pages 522-5, 1992.
12. H. Hansson. Time and Probability in Formal Design of Distributed Systems. Elsevier, 1994.
13. H. Hansson and B. Jonsson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6:512-535, 1994.
14. S. Hart and M. Sharir. Probabilistic temporal logic for finite and bounded models. In Proc. of 16th ACM Symposium on Theory of Computing, pages 1-13. ACM, 1984.
15. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, New Jersey, 1991.
16. G. J. Holzmann. The spin model checker. IEEE Trans. on Software Engineering, 23(5):279-295, May 1997.
17. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In P. Kemper, editor, Proc. Tools Session of Aachen 2001 International Multiconference on Measurement, Modelling and Evaluation of Computer-Communication Systems, pages 7-12, September 2001. Available as Technical Report 760/2001, University of Dortmund.
18. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with prism: A hybrid approach. In Proc. TACAS'02, volume 2280. LNCS, Springer Verlag, April 2002.
19. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94:1-28, 1991.
20. D. Lehmann and M. Rabin. On the advantages of free choice: A symmetric fully distributed solution to the dining philosophers problem (extended abstract). Proc. 8th Symposium on Principles of Programming Languages, pages 133-138, 1981.
21. url: http://sprout.stanford.edu/dill/murphi.html.
22. 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 murphi verifier. In Proc. of 6th International Workshop on: Hybrid Systems: Computation and Control (HSCC), LNCS, Prague, Czech Republic, April 2003. Springer.
23. A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Distributed Computing, 1(1):53-72, 1986.
24. A. Pnueli and L. Zuck. Probabilistic verification. Information and Computation, 103:1-29, 1993.
25. url: http://wvw.cs.bham.ac.uk/∼dxp/prism/.
26. N. Lynchand I. Saias and R. Segala. Proving time bounds for randomized distributed algorithms. In Proc. 13th ACM Symposium on Principles of Distributed Computing, pages 314-323, 1994.
27. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In Proc. of CONCUR, number 836 in LNCS, pages 381-496. Springer, 1994.
28. url: http://netlib.bell-labs.com/netlib/spin/whatispin.html.
29. U. Stern and D. L. Dill. Improved probabilistic verification by hash compaction. In IFIP WG 10.5 Advanced Research Working Conference on: Correct Hardware Design and Verification Methods (CHARME), pages 206-224, 1995.
30. U. Stern and D. L. Dill. A new scheme for memory-efficient probabilistic verification. In IFIP TC6/WG6.1 Joint International Conference on: Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification, 1996.
31. E. Tronci, G. Della Penna, B. Intrigila, and M. Venturini Zilli. Exploiting transition locality in automatic verification. In IFIP WG 10.5 Advanced Research Working Conference on: Correct Hardware Design and Verification Methods (CH-ARME). LNCS, Springer, Sept 2001.
32. M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. of FOCS'85, pages 327-338. IEEE CS Press, 1985.