On reduction criteria for probabilistic reward models

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

Volumn 4337 LNCS, Issue , 2006, Pages 309-320

  Größer, Marcus ^a   Norman, Gethin ^b   Baier, Christel ^a   Ciesinski, Frank ^a   Kwiatkowska, Marta ^b   Parker, David ^b  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS;

BRANCHING TIME; CONCURRENT SYSTEMS; PARTIAL ORDER REDUCTIONS; QUANTITATIVE MEASURES; TEMPORAL PROPERTY;

SOFTWARE ENGINEERING;

EID: 84923278265     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944836_29     Document Type: Conference Paper

References (32)

1. S. Andova, H. Hermanns, and J.-P. Katoen. Discrete-time rewards model-checked. In Proc. FORMATS, volume 2791 of Lecture Notes in Computer Science, pages 88–104, 2003.
2. Mehran Asadi and Manfred Huber. Action dependent state space abstraction for hierarchical learning systems. In Proc. IASTED, Insbruck, Austria, 2005.
3. C. Baier, F. Ciesinski, and M. Groesser.Quantitative analysis of distributed randomized protocols. In Proc. FMICS, 2005.
4. C. Baier, P. D’Argenio, and M. Größer. Partial order reduction for probabilistic branching time. In Proc. QAPL, 2005.
5. C. Baier, M. Größer, and F. Ciesinski. Partial order reduction for probabilistic systems. In QEST 2004 [28], pages 230–239.
6. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. FST TCS, volume 1026 of LNCS, pages 499–513, 1995.
7. P.R. D’Argenio and P. Niebert. Partial order reduction on concurrent probabilistic programs. In QEST 2004 [28], pages 240–249.
8. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, Department of Computer Science, 1997.
9. L. de Alfaro. Temporal logics for the specification of performance and reliability. In Proc. STACS, volume 1200 of Lecture Notes in Computer Science, pages 165–179, 1997.
10. L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proc. 13th LICS, IEEE Press, pages 454–465, 1998.
11. Thomas Dean, Robert Givan, and Sonia Leach. Model reduction techniques for computing approximately optimal solutions for markov decision processes. In Proc. 13th UAI, pages 124–131, San Francisco, California, 1997. Morgan Kaufmann Publishers.
12. R. Gerth, R. Kuiper, D. Peled, and W. Penczek. A partial order approach to branching time logic model checking. In Proc. 3rd ISTCS’95, pages 130–139. IEEE Press, 1995.
13. P. Godefroid. Partial Order Methods for the Verification of Concurrent Systems: An Approach to the State Explosion Problem, volume 1032 of LNCS. Springer-Verlag, 1996.
14. D. Griffioen and F. Vaandrager. Normed simulations. In Proc. 10th International Computer Aided Verification Conference, volume 1427 of LNCS, pages 332–344, 1998.
15. H. Hansson and B. Jonsson. A logic for reasoning about timeand reliability. Formal Aspects of Computing, 6(5):512–535, 1994.
16. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker. PRISM: A tool for automatic verification ofprobabilistic systems. In Proc. 12th TACAS, 2006.To appear.
17. G. Holzmann. The SPIN Model Checker, Primer and Reference Manual. Addison Wesley, 2003.
18. C. Jones. Probabilistic Non-Determinism. PhD thesis, University of Edinburgh, 1990.
19. B. Jonsson and K. Larsen.Specification and refinement of probabilistic processes. In Proc. LICS, pages 266–277. IEEE CS Press, 1991.
20. R. Kurshan, V. Levin, M. Minea, D. Peled, and H. Yenign. Static partial order reduction. In Proc. TACAS, volume 1384 of LNCS, pages 345–357, 1998.
21. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1–28, 1991.
22. K. Namjoshi. A simple characterization of stuttering bisimulation. In Proc. FSTTCS, volume 1346 of LNCS, pages 284–296, 1997.
23. N. Pekergin and Sana Younes. Stochastic model checking with stochastic comparison.In Proc. EPEW/WS-FM, volume 3670 ofLNCS, pages 109–123, 2005.
24. D. Peled. All from one, one for all: On model checking using representatives. InProc. 5th CAV, volume 697 of LNCS, pages 409–423, 1993.
25. D. Peled. Partial order reduction: Linear and branching time logics and process algebras. In [26], pages 79–88, 1996.
26. 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.
27. M. L. Puterman. Markov Decision Processes—Discrete Stochastic Dynamic Programming. John Wiley Sons, Inc., New York, 1994.
28. Proceedings of the 1st International Conference on Quantitative Evaluation of SysTems (QEST 2004). Enschede, the Netherlands. IEEE Computer Society Press, 2004.
29. Balaraman Ravindran and Andrew G. Barto. Model minimization in hierarchical reinforcement learning. In Proc. SARA, pages 196–211. LNCS, 2002.
30. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995.
31. R. Segala and N. Lynch.Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250–273, 1995.
32. A.Valmari. Stubborn set methods for process algebras. In [26], pages 79–88, 1996.