Partial order reduction for markov decision processes: A survey

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

Volumn 4111 LNCS, Issue , 2006, Pages 408-427

  Groesser, Marcus ^a   Baier, Christel ^a  

^a Institut für Informatik I   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; MATHEMATICAL MODELS; PROBABILITY;

DECISION DIAGRAMS; MODEL CHECKING ALGORITHMS; PARTIAL ORDER REDUCTION;

MARKOV PROCESSES;

EID: 33749646968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11804192_19     Document Type: Conference Paper

References (44)

1. C. Baier, F. Ciesinski, and M. Groesser. Quantitative analysis of distributed randomized protocols. In Proc. of the tenth International Workshop on Formal Methods for Industrial Critical Systems (FMICS 05), 2005.
2. C. Baier, E. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. In Proc. International Colloqium on Automata, Languages and Programming (ICALP), volume 1256 of Lecture Notes in Computer Science, pages 430-440, 1997.
3. C. Baier, P. D'Argenio, and M. Größer. Partial order reduction for probabilistic branching time. In Proc. QAPL, 2005.
4. C. Baier, B. Engelen, and M. Majster-Cederbaum. Deciding bisimularity and similarity for probabilistic processes. Jounal of Computer and System Sciences, 60:187-231, 2000.
5. C. Baier, M. Größer, and F. Ciesinski. Partial order reduction for probabilistic systems. In QEST 2004 [37], pages 230-239.
6. C. Baier, B. Haverkort, H. Hermanns, J.-P. Katoen, and M. Siegle, editors. Validation of Stochastic Systems, volume 2925 of Lecture Notes in Computer Science, 2003.
7. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. Foundations of Software Technology and Theoretical Computer Science (FST & TCS), volume 1026 of Lecture Notes in Computer Science, pages 499-513, 1995.
8. M. Bozga and O. Maler. On the Representation of Probabilities over Structured Domains. In Proc. International Conference on Computer Aided Verification (CAV), volume 1633 of Lecture Notes in Computer Science, pages 261-273, 1999.
9. S. Cattani and R. Segala. Decision algorithms for probabilistic bisimulation. In Proc. International Conference on Concurrency Theory (CONCUR), volume 2421 of Lecture Notes in Computer Science, pages 371-385, 2002.
10. E. Clarke, Orna Grumberg, and Doron Peled. Model Checking. MIT Press, 1999.
11. C. Courcoubetis and M. Yannakakis. Markov decision processes and regular events (extended abstract). In Proc. 17th on International Colloquium Automata, Languages and Programming (ICALP), volume 443 of Lecture Notes in Computer Science, pages 336-349, 1990.
12. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4).-857-907, 1995.
13. P. d' Argenio, B. Jeannet, H. Jensen, and K. Larsen. Reachability analysis of probabilistic systems by successive refinements. In [17], pages 57-76, 2001.
14. P.R. D'Argenio and P. Niebert. Partial order reduction on concurrent probabilistic programs. In QEST 2004 [37], pages 240-249.
15. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, Department of Computer Science, 1997.
16. L. de Alfaro. Stochastic transition systems. In Proc. 9th International Conference on Concurrency Theory (CONCUR), volume 1466 of Lecture Notes in Computer Science, pages 423-438, 1998.
17. L. de Alfaro and S. Gilmore, editors. Proc. 1st Joint Int. Workshop Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPMPROBMIV), volume 2399 of Lecture Notes in Computer Science. Springer, 2001.
18. H. Fecher, M. Leuker, and V. Wolf. Don't know in probabilistic systems. In Proceedings of 13th International SPIN Workshop on Model Checking of Software (SPIN'06), 2006.
19. R. Gerth, R. Kuiper, D. Peled, and W. Penczek. A partial order approach to branching time logic model checking. In Proc. 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95), pages 130-139. IEEE Press, 1995.
20. P. Godefroid. Partial Order Methods for the Verification of Concurrent Systems: An Approach to the State Explosion Problem, volume 1032 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
21. P. Godefroid, D. Peled, and M. Staskauskas. Using partial-order methods in the formal validation of industrial concurrent programs. In Proc. International Symposium on Software Testing and Analysis, pages 261-269. ACM Press, 1996.
22. G. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Probabilistic Analysis of Large Finite State Machines. In 31st ACM/IEEE Design Automation Conference (DAC). San Diego Convention Center, 1994.
23. H. Hermanns, M. Kwiatkowska, G. Norman, D. Parker, and M. Siegle. On the use of MTBDDs for performability analysis and verification of stochastic systems. Journal of Logic and Algebraic Programming: Special Issue on Probabilistic Techniques for the Design and Analysis of Systems, 56:23-67, 2003.
24. H. Hermanns and R. Segala, editors. Proc. 2nd Joint Int. Workshop Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV), volume 2399 of Lecture Notes in Computer Science. Springer, 2002.
25. G. Holzmann and D. Peled. An improvement in formal verification. In Proc. Formal Description Techniques, FORTE94, pages 197-211, Berne, Switzerland, October 1994. Chapman & Hall.
26. M. Huth. Possibilistic and probabilistic abstraction-based model checking. In [24], pages 115-134, 2002.
27. M. Huth. Abstraction and probabilities for hybrid logics. In Proc. 2nd workshop on Quantitative Aspects of Programming Languages, 2004.
28. B. Jonsson and K. Larsen. Specification and refinement of probabilistic processes. In Proc. LICS, pages 266-277. IEEE CS Press, 1991.
29. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: A hybrid approach. International Journal on Software Tools for Technology Transfer (STTT), 2004.
30. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):l-28, 1991.
31. A. Miner and D. Parker. Symbolic representations and analysis of large probabilistic systems. In [6], 2003.
32. D. Peled. All from one, one for all: On model checking using representatives. In Proc. 5th International Computer Aided Verification Conference (CAV), volume 697 of Lecture Notes in Computer Science, pages 409-423, 1993.
33. D. Peled. Partial order reduction: Linear and branching time logics and process algebras. In [34], pages 79-88, 1996.
34. D. Peled, V. Pratt, and G. Holzmann, editors. Partial Order Methods in Verification, volume 29(10) of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1997.
35. A. Pnueli and L. D. Zuck. Probabilistic verification. Information and Computation, 103(1):l-29, 1993.
36. M. L. Puterman. Markov Decision Processes-Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York, 1994.
37. Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004). Enschede, the Netherlands. IEEE Computer Society Press, 2004.
38. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995.
39. A. Valmari. A stubborn attack on state explosion. Formal Methods in System Design, 1:297-322, 1992.
40. A. Valmari. State of the art report: Stubborn sets. Petri-Net Newsletters, 46:6-14, 1994.
41. A. Valmari. Stubborn set methods for process algebras. In [34], pages 79-88, 1996.
42. R. van Glabbeek, S. Smolka, B. Steffen, and C. Tofts. Reactive, generative, and stratified models of probabilistic processes. In Proc. 5th Annual Symposium on Logic in Computer Science (LICS), pages 130-141. IEEE Computer Society Press, 1990.
43. M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. 26th IEEE Symposium on Foundations of Computer Science (FOCS), pages 327-338, 1985.
44. M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In Proc. 1st Annual Symposium on Logic in Computer Science (LICS), pages 332-344. IEEE Computer Society Press, 1986.