Probabilistic weak simulation is decidable in polynomial time

Information Processing Letters

Volumn 89, Issue 3, 2004, Pages 123-130

  Baier, Christel ^a   Hermanns, Holger ^b,c   Katoen, Joost Pieter ^c  

^a UNIVERSITY OF BONN   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

^c UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Algorithms; Computational complexity; Markov chains; Performance evaluation; Simulation preorder

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; POLYNOMIALS;

LUMPABILITY; REDUCTION TECHNIQUES;

MARKOV PROCESSES;

EID: 0347354822     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.10.001     Document Type: Article

References (28)

1. Andova S., Baeten J. Abstraction in probabilistic process algebra. Margaria T., Yi W. Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Comput. Sci. Vol. 2031:2001;204-219 Springer, Berlin.
2. Baier C., Engelen B., Majster-Cederbaum M. Deciding bisimilarity and similarity for probabilistic processes. J. Comput. System Sci. 60:(1):2000;187-231.
3. Baier C., Hermanns H. Weak bisimulation for fully probabilistic systems. Grumberg O. Computer-Aided Verification. Lecture Notes in Comput. Sci. Vol. 1256:1997;119-130 Springer, Berlin.
4. Baier C., Hermanns H., Katoen J.-P., Wolf V. Comparative branching-time semantics for Markov chains. de Simone R., Lugiez D. Concurrency Theory. Lecture Notes in Comput. Sci. Vol. 2761:2003;492-508 Springer, Berlin.
5. Baier C., Katoen J.-P., Hermanns H., Haverkort B. Simulation for continuous-time Markov chains. Brim L., et al. Concurrency Theory. Lecture Notes in Comput. Sci. Vol. 2421:2002;338-354 Springer, Berlin.
6. Baier C., Stoelinga M. Norm functions for probabilistic bisimulations with delays. Tiuryn J. Found. of Software Science and Computation Structures. Lecture Notes in Comput. Sci. Vol. 1784:2000;1-16 Springer, Berlin.
7. Bravetti M. Revisiting interactive Markov chains. Vogler W., Larsen K.G. Models for Time-Critical Systems. BRICS Notes Series NS-02-3. 2002;60-80.
8. Brown M., Clarke E., Grumberg O. Characterizing finite Kripke structures in propositional temporal logic. Theoret. Comput. Sci. 59:1988;115-131.
9. Buchholz P. Exact and ordinary lumpability in finite Markov chains. J. Appl. Probab. 31:1994;59-75.
10. Cattani S., Segala R. Decision algorithms for probabilistic bisimulation. Brim L., et al. Concurrency Theory. Lecture Notes in Comput. Sci. Vol. 2421:2002;371-385 Springer, Berlin.
11. Derisavi S., Hermanns H., Sanders W.H. Optimal state-space lumping in Markov chains. Inform. Process. Lett. 87:(6):2003;309-315.
12. Gentilini R., Piazza C., Policriti A. Simulation as coarsest partition problem. Katoen J.-P., Stevens P. Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Comput. Sci. Vol. 2280:2002;415-430 Springer, Berlin.
13. van Glabbeek R.J., Weijland W.P. Branching time and abstraction in bisimulation semantics. J. ACM. 43:(3):1996;555-600.
14. Henzinger M.R., Henzinger T., Kopke P.W. Computing simulations on finite and infinite graphs. IEEE Symp. on Foundation of Comp. Sci. 1995;453-462.
15. Hillston J. A Compositional Approach to Performance Modelling. 1996;Cambridge Univ. Press, Cambridge.
16. Hyunh T., Tian L. On some equivalence relations for probabilistic processes. Fund. Inform. 17:1992;211-234.
17. Jonsson B. Simulations between specifications of distributed systems. Baeten J.C.M., Groote J.F. Concurrency Theory. Lecture Notes in Comput. Sci. Vol. 527:1991;346-360 Springer, Berlin.
18. Jones C., Plotkin G. A probabilistic powerdomain of evaluations. IEEE Symp. on Logic in Computer Science. 1989;186-195.
19. Jonsson B., Larsen K.G. Specification and refinement of probabilistic processes. IEEE Symp. on Logic in Computer Science. 1991;266-277.
20. Kemeny J.G., Snell J.L. Finite Markov Chains. 1960;Van Nostrand, New York.
21. Kulkarni V.G. Modeling and Analysis of Stochastic Systems. 1995;Chapman & Hall, London.
22. Milner R. Communication and Concurrency. 1989;Prentice-Hall, Englewood Cliffs, NJ.
23. Paige R., Tarjan R. Three partition refinement algorithms. SIAM J. Comput. 16:(6):1987;973-989.
24. Papadimitriou C.H., Steiglitz K. Combinatorial Optimization: Algorithms and Complexity. 1998;Dover, Mineola, NY.
25. Philippou A., Lee I., Sokolsky O. Weak bisimulation for probabilistic systems. Palamidessi C. Concurrency Theory. Lecture Notes in Comput. Sci. Vol. 1877:2000;334-349 Springer, Berlin.
26. Puterman M.L. Markov Decision Processes: Discrete Stochastic Dynamic Programming. 1994;John Wiley & Sons, New York.
27. Schrijver A. Theory of Linear and Integer Programming. 1986;John Wiley & Sons, New York.
28. Tan L., Cleaveland R. Simulation revisited. Margaria T., Yi W. Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Comput. Sci. Vol. 2031:2002;480-495 Springer, Berlin.