Partial order reduction on concurrent probabilistic programs

Proceedings - First International Conference on the Quantitative Evaluation of Systems, QEST 2004

Volumn , Issue , 2004, Pages 240-249

  D'Argenio, Pedro R ^a,b   Niebert, Peter ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

^b UNIVERSIDAD NACIONAL DE CÓRDOBA   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONCURRENCY CONTROL; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

CONCURRENT PROBABILISTIC PROGRAMS; DEADLOCK STATES; FUNCTIONAL ANALYSIS; PARTIAL ORDER REDUCTION;

COMPUTER SOFTWARE;

EID: 16244419032     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/qest.2004.1348038     Document Type: Conference Paper

References (22)

1. C. Baier, M. Größer, and F. Ciesinski. Partial order reduction for probabilistic systems. In Proc. of QEST 2004. IEEE Press, 2004. (This volume).
2. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. of 15th FST&TCS, LNCS 1026, pp. 499-513. Springer, 1995.
3. P. D'Argenio, B. Jeannet, H. Jensen, and K. Larsen. Reachability analysis of probabilistic systems by succes sive refinements. In Proc. of PAPM/PROBMIV 2001, LNCS 2165, pp. 39-56. Springer, 2001.
4. P. D'Argenio, B. Jeannet, H. Jensen, and K. Larsen. Reduction and refinement strategies for probabilistic analysis. In Proc. of PAPM/PROBMIV 2002, LNCS 2399. Springer, 2002.
5. L. de Alfaro. Temporal logics for the specification of performance and reliability. In Proc. of STACS'97, LNCS 1200, pp. 165-176. Springer, 1997.
6. V. Diekert and G. Rozenberg, eds. The Book of Traces. World Scientific, 1995.
7. R. Gerth, R. Kuiper, D. Peled, and W. Penczek. A partial order approach to branching time logic model checking. Inf & Comp., 150(2):132-152, 1999.
8. P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems, LNCS 1032. Springer, 1996.
9. G. Holzmann and D. Peled. An improvement in formal verification. In D. Hogrefe and S. Leue, eds., Proc. of FORTE'94, pp. 197-211. North-Holland, 1994.
10. M. Huhn, P. Niebert, and H. Wehrheim. Partial order reduction for bisimulation checking. In Proc. of 18th FST&TCS, LNCS 1530, pp. 271-282. Springer, 1995.
11. B. Jeannet, P. D'Argenio, and K. Larsen. RAPTURE: A tool for verifying Markov decision processes. In Proc. of Tools Day at CONCUR 2002, 2002. Web page: www.irisa.fr/prive/bjeannet/prob/prob.html.
12. th LICS, pp. 266-277. IEEE Press, 1991.
13. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In Proc. of TOOLS'2002, LNCS 2324. Springer, 2002. Web page: www.cs.bham.ac.uk/~dxp/prism/.
14. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Inf & Comp., 94:1-28, 1991.
15. P. Niebert and W. Penczek. On connection of partial order logics and partial order reduction methods. Technical report, Tech. Univ. of Eindhoven, 1995.
16. D. Peled. All from one, one for all: On model checking using representatives. In C. Courcoubetis, ed., Proc. of 5th CAV, LNCS 697, pp. 409-423. Springer, 1993.
17. M. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley, 1994.
18. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995.
19. M. Stoelinga. Alea jacta est: Verification of Probabilistic, Real-time and Parametric Systems. PhD thesis, University of Nijmegen, 2002.
20. A. Valmari. Stubborn sets for reduced state space generation. In Proc. of the 10th Int. Conf. on App. and Theory of Petri Nets, LNCS 483, pp. 491-515. Springer, 1989.
21. D. Varacca and M. Nielsen. Probabilistic Petri nets and mazurkiewicz equivalence, 2003. Unpublished draft.
22. th FOCS, pp. 327-338. IEEE Press, 1985.