Symblicit calculation of long-run averages for concurrent probabilistic systems

Proceedings - 7th International Conference on the Quantitative Evaluation of Systems, QEST 2010

Volumn , Issue , 2010, Pages 27-36

  Wimmer, Ralf ^a   Braitling, Bettina ^a   Becker, Bernd ^a   Hahn, Ernst Moritz ^b   Crouzen, Pepijn ^b   Hermanns, Holger ^b   Dhama, Abhishek ^c   Theel, Oliver ^c  

^a UNIVERSITY OF FREIBURG   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

^c UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE BEHAVIOR; AVERAGE REWARD; EXPLICIT STATE; LINEAR EQUATION SYSTEM; MARKOV CHAIN; MARKOV DECISION PROCESSES; MINIMIZATION ALGORITHMS; MODEL CHECKER; PROBABILISTIC SYSTEMS; STATE SPACE; SYMBOLIC BISIMULATION; SYMBOLIC REPRESENTATION;

ALGORITHMS; EQUATIONS OF STATE; MARKOV PROCESSES; MODEL CHECKING; OPTIMIZATION;

BINARY DECISION DIAGRAMS;

EID: 78649453694     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2010.12     Document Type: Conference Paper

References (30)

1. A. Hinton, M. Z. Kwiatkowska, G. Norman, and D. Parker, "PRISM: A tool for automatic verification of probabilistic systems," in 12th Int'l Conf. on Tool and Algorithm for the Construction and Analysis of Systems (TACAS), ser. LNCS, vol. 3920. Springer, 2006, pp. 441-444.
2. M. L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, 1994.
3. A. Dhama, O. Theel, P. Crouzen, H. Hermanns, R. Wimmer, and B. Becker, "Dependability engineering of silent selfstabilizing systems," in 11th Int'l Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), ser. LNCS, vol. 5873. Springer, 2009, pp. 238-253.
4. A. Bianco and L. de Alfaro, "Model checking of probabilistic and nondeterministic systems," in 15th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), ser. LNCS, vol. 1026. Springer, 1995, pp. 499-513.
5. L. de Alfaro, "How to specify and verify the long-run average behavior of probabilistic systems," in 13th Annual IEEE Symp. on Logic in Computer Science (LICS). Indianapolis, Indiana, USA: IEEE CS, 1998, pp. 454-465.
6. E. Böde, M. Herbstritt, H. Hermanns, S. Johr, T. Peikenkamp, R. Pulungan, J. Rakow, R. Wimmer, and B. Becker, "Compositional dependability evaluation for statemate," IEEE Transactions on Software Engineering, vol. 35, no. 2, pp. 274-292, 2009.
7. M. Z. Kwiatkowska, G. Norman, and D. Parker, "Probabilistic symbolic model checking with PRISM: A hybrid approach," Software Tools for Technology Transfer, vol. 6, no. 2, pp. 128-142, 2004.
8. R. A. Howard, Dynamic Programming and Markov Processes. John Wiley and Sons, Inc., 1960.
9. A. F. Veinott, "On finding optimal policies in discrete dynamic programming with no discounting," Annals of Mathematical Statistics, vol. 37, no. 5, pp. 1284-1294, 1966.
10. D. Lehmann and M. O. Rabin, "On the advantage of free choice: A symmetric and fully distributed solution to the dining philosophers problem (extended abstract)," in 8th Annual ACM Symp. on Principles of Programming Languages (POPL). ACM Press, 1981, pp. 133-138.
11. M. Duflot, L. Fribourg, and C. Picaronny, "Randomized dining philosophers without fairness assumption," Distributed Computing, vol. 17, no. 1, pp. 65-76, 2004.
12. Z. Collin and S. Dolev, "Self-stabilizing depth-first search," Information Processing Letters, vol. 49, no. 6, pp. 297-301, 1994.
13. J. G. Kemeney and J. L. Snell, Finite Markov Chains. D. Van Nostrand Company, Inc., 1960.
14. K. G. Larsen and A. Skou, "Bisimulation through probabilistic testing," Information and Computation, vol. 1, no. 94, pp. 1-28, 1991.
15. P. Buchholz, "Exact and ordinary lumpability in finite Markov chains," Journal of Applied Probability, vol. 31, pp. 59-74, 1994.
16. C. Baier, J.-P. Katoen, H. Hermanns, and V. Wolf, "Comparative branching-time semantics for Markov chains," Information and Computation, vol. 200, no. 2, pp. 149-214, 2005.
17. R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Transactions on Computers, vol. 35, no. 8, pp. 677-691, 1986.
18. M. Fujita, P. C. McGeer, and J. C.-Y. Yang, "Multiterminal binary decision diagrams: An efficient data structure for matrix representation," Formal Methods in System Design, vol. 10, no. 2/3, pp. 149-169, 1997.
19. S. Derisavi, "Signature-based symbolic algorithm for optimal Markov chain lumping," in 4th Int'l Conf. on Quantitative Evaluation of Systems (QEST). IEEE CS, 2007, pp. 141-150.
20. R. Wimmer and B. Becker, "Correctness issues of symbolic bisimulation computation for Markov chains," in 15th Int'l Conf. on Measurement, Modelling and Evaluation of Computing Systems (MMB), ser. LNCS, vol. 5987. Springer, 2010, pp. 287-301.
21. H. Hermanns, M. Z. 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, vol. 56, no. 1-2, pp. 23-67, 2003.
22. R. Wimmer, B. Braitling, B. Becker, E. M. Hahn, P. Crouzen, H. Hermanns, A. Dhama, and O. Theel, "Symblicit calculation of long-run averages for concurrent probabilistic systems (extended version)," http://ira. informatik.uni-freiburg.de/research/qest2010-extended.pdf, 2010.
23. C. Baier and J.-P. Katoen, Principles of Model Checking. The MIT Press, 2008.
24. R. Wimmer, M. Herbstritt, H. Hermanns, K. Strampp, and B. Becker, "Sigref - A symbolic bisimulation tool box," in 4th Int'l Symp. on Automated Technology for Verification and Analysis (ATVA), ser. LNCS, vol. 4218. Springer, 2006, pp. 477-492.
25. F. Somenzi, "CUDD: Colorado university decision diagram package, release 2.4.2," 2009.
26. W. J. Stewart, Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
27. N. Lynch, I. Saias, and R. Segala, "Proving time bounds for randomized distributed algorithms," in 13th Annual ACM Symp. on Principles of Distributed Computing (PODC). ACM Press, 1994, pp. 314-323.
28. A. Itai and M. Rodeh, "Symmetry breaking in distributed networks," Information and Computation, vol. 88, no. 1, 1990.
29. 2 N-valued shared variable," Journal of Computer and System Sciences, vol. 25, no. 1, pp. 66-75, 1982.
30. D. Chaum, "The dining cryptographers problem: Unconditional sender and recipient untraceability," Journal of Cryptology, vol. 1, pp. 65-75, 1988.