Deciding bisimilarity and similarity for probabilistic processes

Journal of Computer and System Sciences

Volumn 60, Issue 1, 2000, Pages 187-231

  Baier, Christel ^a   Engelen, Bettina ^b   Majster Cederbaum, Mila ^b  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECISION THEORY; EQUIVALENCE CLASSES; MARKOV PROCESSES;

BISIMULATION EQUIVALENCE CLASSES; LABELED TRANSITION SYSTEMS; PARTITIONING TECHNIQUE; SIMULATION PREORDER;

PROBABILISTIC LOGICS;

EID: 0034140755     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1683     Document Type: Article

References (72)

1. G. Adel'son-Velshii and Y. Landis, An algorithm for the organization of information, Soviet. Math. Dokl. 3 (1962), 1259-1262.
2. J. Baeten, J. Bergstra, and S. Smolka, Axiomatizing probabilistic processes: ACP with generative probabilities, in "Proc. CONCUR'92," Lecture Notes in Computer Science, Vol. 630, pp. 472-485, Springer-Verlag, Berlin, 1992.
3. The full version with the same title has appeared in Inform. and Comput. 122 (1995), 234-255.
4. I. Bahar, E. Frohm, C. Gaona, G. Hachetel, E. Macii, A. Padro, and F. Sommenzi, Algebraic decision diagrams and their applications, in "Proc. ICCAD'93," pp. 188-191, 1993.
5. The full version with the same title has appeared in Formal Methods in Systems Design 10 (1997), 171-206.
6. C. Baier, Polynomial time algorithms for testing probabilistic bisimulations and simulation, in "Proc. CAV'96," Lecture Notes in Computer Science, Vol. 1102, pp. 38-49, Springer-Verlag, Berlin, 1996.
7. C. Baier, "On Algorithmic Verification Methods for Probabilistic Systems," Habilitation Thesis, Universität Mannheim, 1998.
8. C. Baier, E. Clarke, and V. Hartonas-Garmhausen, On the semantical foundations of probabilistic synchronous reactive programs, in "Proc. PROBMIV'98," Electronic Notes in Theoretical Computer Science, Vol. 22, 1999.
9. C. Baier, E. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan, Symbolic model checking for probabilistic processes, in "Proc. ICALP'97," Lecture Notes in Computer Science, Vol. 1256, pp. 430-440, Springer-Verlag, Berlin, 1997.
10. C. Baier and H. Hermanns, Weak bisimulation for fully probabilistic processes, in "Proc. CAV'97," Lecture Notes in Computer Science, Vol. 1254, pp. 119-130, Springer-Verlag, Berlin, 1997.
11. C. Baier and M. Kwiatkowska, Domain equations for probabilistic processes, to appear in Math. Structurs Comput. Sci. (1999).
12. Preliminary version in "Proc. EXPRESS'97, Electronic Notes in Theoretical Computer Science, Vol. 7, 1997.
13. C. Baier and M. Stoelinga, "Abstraction in Probabilistic Systems with Normed Bisimulation," submitted for publication, 1999.
14. A. Bianco and L. de Alfaro, Model checking of probabilistic and nondeterministic systems, in "Proc. Foundations of Software Technology and Theoretical Computer Science," Lecture Notes in Computer Science, Vol. 1026, pp. 499-513, Springer-Verlag, Berlin, 1995.
15. T. Bolognesi and S. Smolka, Fundamental results for the verification of observational equivalence: a survey, in "Protocol Specification, Testing and Verification," pp. 165-179, Elsevier Science, Amsterdam, 1987.
16. S. Brookes, C. A. R. Hoare, and A. Roscoe, A theory of communicating sequential processes, Assoc. Comput. Mach. 31 (1984), 560-599.
17. 20 states and beyond, in "Proc. LICS'90," pp. 428-439, 1990.
18. The full version with the same title has appeared in Inform. and Comput. 98 (1992), 142-170.
19. J. Cheriyan, T. Hagerup, and K. Mehlhorn, Can a maximum flow be computed in O(nm) time?, in "Proc. ICALP'90," Lecture Notes in Computer Science, Vol. 443, pp. 235-248, Springer-Verlag, Berlin, 1990.
20. I. Christoff, Testing equivalences and fully abstract models for probabilistic processes, in "Proc. CONCUR'92," Lecture Notes in Computer Science, Vol. 458, pp. 126-140, Springer-Verlag, Berlin, 1990.
21. L. Christoff and I. Christoff, Efficient algorithms for verification of equivalences for probabilistic processes, in "Proc. CAV'91," Lecture Notes in Computer Science, Vol. 575, pp. 310-321, Springer-Verlag, Berlin, 1991.
22. L. Christoff, "Specification and Verification Methods for Probabilistic Processes," Ph.D. Thesis, Department of Computer Science, Uppsala University, 1993.
23. E. Clarke, M. Fujita, P. McGeer, J. Yang, and X. Zhao, Multi-terminal binary decision diagrams: An efficient data structure for matrix representation, in "Proc. IWLS'93: International Workshop on Logic Synthesis, Tahoe City, 1993."
24. R. Cleaveland, J. Parrow, and B. Steffen, A semantic based verification tool for finite state systems, in "Protocol Specification, Testing and Verification IX," pp. 287-302, Elsevier Science, Amsterdam, 1990.
25. R. Cleaveland, S. Smolka, and A. Zwarico, Testing preorders for probabilistic processes, in "Proc ICALP 1992," Lecture Notes in Computer Science, Vol. 623, pp. 708-719, Springer-Verlag, Berlin, 1992.
26. E. Dinic, Algorithm for solution of a problem of maximal flow in a network with power estimation, Soviet. Math. Dokl. 11 (1970), 1277-1280.
27. L. de Alfaro, in "Formal Verification of Probabilistic Systems," Ph.D. Thesis, Stanford University, 1997.
28. P. d'Argenio, H. Hermanns, and J. Katoen, On generative parallel composition, in "Proc. PROBMIV98," Electronic Notes in Theoretical Computer Science, Vol. 22, 1999.
29. R. Enders, T. Filkorn, and D. Taubner, Generating BDDs for symbolic model checking in CCS, Distrib. Comput. 6 (1993), 155-164.
30. S. Even, "Graph Algorithms," Computer Science Press, New York, 1979.
31. J. C. Fernandez, An implementation of an efficient algorithm for bisimulation equivalence, Sci. Comput. Programming 13 (1989/90), 219-236.
32. L. Ford and D. Fulkerson, "Flows in Networks," Princeton University Press, Princeton, 1962.
33. A. Giacalone, C. Jou, and S. Smolka, Algebraic reasoning for probabilistic concurrent systems, in "Proc. IFIP TC2 Working Conference on Programming Concept and Methods, 1990."
34. R. van Glabbeek, S. Smolka, B. Steffen, and C. Tofts, Reactive, generative, and stratified models for probabilistic processes, in "Proc. LICS'90," pp. 130-141, 1990.
35. J. Groote and F. Vaandrager, An efficient algorithm for branching bisimulation and stuttering equivalence, in "Proc ICALP'90," Lecture Notes in Computer Science, Vol. 443, pp. 626-638, Springer-Verlag, Berlin, 1990.
36. S. Hart, M. Sharir and A. Pnueli, Termination of probabilistic concurrent programs, ACM Trans. Programming Languages 5 (1983), 356-380.
37. V. Hartonas-Garmhausen, "Probabilistic Symbolic Model Checking with Engineering Models and Applications," Ph.D. Thesis, Carnegie Mellon University, 1998.
38. V. Hartonas-Garmhausen, S. Campos, and E. Clarke, Prob Versus: Probabilistic symbolic model checking, in "Proc. ARTS'99," Lecture Notes in Computer Science, Vol. 1601, pp. 96-110, Springer-Verlag, Berlin, 1999.
39. H. Hansson, Time and probability in formal design on distributed systems, in "Real-Time Safety-Critical Systems," Vol. 1, Elsevier, Amsterdam, 1994.
40. H. Hansson and B. Jonsson, A calculus for communicating systems with time and probabilities, in "Proc. IEEE Real-Time Systems Symposium, 1990."
41. H. Hansson and B. Jonsson, A logic for reasoning about time and probability, Formal Aspects Comput. 6 (1994), 512-535.
42. M. Henzinger, T. Henzinger, and P. Kopke, Computing simulations on finite and infinite graphs, in "Proc. FOCS'95," pp. 453-462, 1995.
43. T. Huynh and L. Tian, On some equivalence relations for probabilistic processes, Fund. Inform. 17 (1992), 211-234.
44. B. Jonsson and K. G. Larsen, Specification and refinement of probabilistic processes, in "Proc. LICS'91," pp. 266-277, 1991.
45. B. Jonsson and W. Yi, Compositional testing preorders for probabilistic processes, in "Proc. LICS'95," pp. 431-443, 1995.
46. C. C. Jou and S. Smolka, Equivalences, congruences and complete axiomatizations for probabilistic processes, in "Proc. CONCUR'90," Lecture Notes in Computer Science, Vol. 458, pp. 367-383, Springer-Verlag, Berlin, 1990.
47. P. Kannelakis and S. Smolka, CCS expressions, finite state processes and three problems of equivalence, in "Proc. 2nd ACM Symposium on the Principles of Distributed Computing," pp. 228-240, 1983.
48. The full version appeared in Inform. Comput. 86 (1990), 43-68.
49. K. Larsen and A. Skou, Bisimulation through probabilistic testing, in "Proc. POPL'89, 1989."
50. The full version with the same title has appeared in Inform. and Comput. 94 (1991), 1-28.
51. K. Larsen and S. Skou, Compositional verification of probabilistic processes, in "Proc. CONCUR'92," Lecture Notes in Computer Science, Vol. 630, pp. 456-471, Springer-Verlag, Berlin, 1992.
52. 3|) algorithm for finding maximum flows in networks, in "Computer Science Program," Indian Institute of Technology, Kanpur 208016, 1978.
53. R. Milner, "A Calculus of Communicating Systems," Lecture Notes in Computer Science, Vol. 92, 1980.
54. R. Milner, "Communication and Concurrency," Prentice-Hall, New York, 1989.
55. I. Nievergelt and E. Reinhold, Binary search trees of bounded balance, in "SICOMP 2," pp. 33-43, 1973.
56. R. de Nicola and M. Hennessy, Testing equivalences for processes, Theoret. Comput. Sci. 34 (1983), 83-133.
57. R. Paige and R. Tarjan, Three partition refinement algorithms, SIAM J. Comput. 16 (1987), 973-989.
58. D. Park, Concurrency and automata on infinite sequences, in "Proc. 5th GI Conference," Lecture Notes in Computer Science, Vol. 104, pp. 167-183, Springer-Verlag, Berlin, 1981.
59. A. Phillipou, O. Sokolsky, and I. Lee, Weak bisimulation for probabilistic systems, submitted for publication.
60. A. Pnueli and L. Zuck, Verification of multiprocess probabilistic protocols, Distrib. Comput. 1 (1986), 53-72.
61. A. Pogosyants, R. Segala, and N. Lynch, Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study, in "Proc. WDAG'97," Lecture Notes in Computer Science, Vol. 1320, pp. 111-125, Springer-Verlag, Berlin, 1997.
62. R. Segala, "Modeling and Verification of Randomized Distributed Real-Time Systems," Ph.D. Thesis, Massachusetts Institute of Technology, 1995.
63. R. Segala and N. Lynch, Probabilistic simulations for probabilistic processes, in "Proc. CONCUR 94," Lecture Notes in Computer Science, Vol. 836, pp. 481-496, Springer-Verlag, Berlin, 1994.
64. [The full version has appeared in Nordic J. Comput. 2 (1995), 250-273.]
65. R. Segala, A compositional trace-based semantics for probabilistic automata, in "Proc. CONCUR'95," Lecture Notes in Computer Science, Vol. 962, pp. 234-248, Springer-Verlag, Berlin, 1995.
66. M. Stoelinga and F. Vaandrager, Root contention in IEEE 1394, in "Proc. ARTS'99," Lecture Notes in Computer Science, Vol. 1601, pp. 53-74, Springer-Verlag, Berlin, 1999.
67. C. Tofts, Processes with probabilities, Formal Aspects comput. 6, No. 5 (1994).
68. M. Vardi, Automatic verification of probabilistic concurrent finite-state programs, in "Proc. 26th Symp. on Foundations of Computer Science," pp. 327-338, 1985.
69. E. de Vink and J. Rutten, Bisimulation for probabilistic transition systems: A coalgebraic approach, in "Proc. ICALP'97," Lecture Notes in Computer Science, Vol. 1256, pp. 460-470, Springer-Verlag, Berlin, 1997.
70. S. Yuen, R. Cleaveland, Z. Dayar, and S. Smolka, Fully abstract characterizations of testing preorders for probabilistic processes, in "Proc. CONCUR'94," Lecture Notes in Computer Science, Vol. 836, pp. 497-512, Springer-Verlag, Berlin, 1994.
71. W. Yi, Algebraic reasoning for real-time probabilistic processes with uncertain information, in "Proc. FTRTFT'94," Lecture Notes in Computer Science, Vol. 863, pp. 680-693, Springer-Verlag, Berlin, 1994.
72. W. Yi and K. Larsen, Testing probabilistic and nondeterministic processes, in "Protocol Specification, Testing and Verification XII," pp. 47-61, Elsevier Science, Amsterdam, 1992.