Undecidable equivalences for basic parallel processes

Information and Computation

Volumn 207, Issue 7, 2009, Pages 812-829

  Hüttel, Hans ^a   Kobayashi, Naoki ^b   Suto, Takashi ^b  

^a Department of Computer Science ^*  (Denmark)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC PARALLEL PROCESS; BISIMULATION; BRANCHING-TIME SPECTRUM; LINEAR TIME; PREORDERS; TRACE EQUIVALENCE;

EID: 65649147585     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2008.12.011     Document Type: Article

References (19)

1. Bergstra J.A., and Klop J.W. Process algebra for synchronous communication. Information and Control 60 1-3 (1984) 109-137
2. Christensen S., Hirshfeld Y., and Moller F. Bisimulation is decidable for all basic parallel processes. Proceedings of CONCUR'93. Lecture Notes in Computer Science vol. 715 (1993), Springer-Verlag
3. Christensen S., Hirshfeld Y., and Moller F. Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. Proceedings of IEEE Symposium on Logic in Computer Science (1993), IEEE Computer Society Press 386-396
4. Christensen S., Hüttel H., and Stirling C. Bisimulation equivalence is decidable for all context-free processes. Information and Computation 121 2 (1995) 143-148
5. Groote J.F., and Hüttel H. Undecidable equivalences for basic process algebra. Information and Computation 115 2 (1994) 354-371
6. Groote J.F., and Vaandrager F.W. Structural operational semantics and bisimulation as a congruence (extended abstract). In: Ausiello G., Dezani-Ciancaglini M., and Rocca S.R.D. (Eds). ICALP. Lecture Notes in Computer Science vol. 372 (1989), Springer 423-438
7. Hirshfeld Y. Petri nets and the equivalence problem. CSL 1993. Lecture Notes in Computer Science vol. 832 (1993), Springer-Verlag 165-174
8. Hopcroft J., and Ullman J. Introduction to Automata Theory, Languages, and Computation (1979), Addison-Wesley
9. Hüttel H. Undecidable equivalence for basic parallel processes. Proceedings of TACS94. Lecture Notes in Computer Science vol. 789 (1994), Springer-Verlag 454-464
10. Huynh D.T., and Tian L. On deciding readiness and failure equivalences for processes. Information and Computation 117 2 (1995) 193-205
11. Kanellakis P., and Smolka S. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation 86 (1990) 43-68
12. Kobayashi N. Type systems for concurrent programs. Proceedings of UNU/IIST 20th Anniversary Colloquium. Lecture Notes in Computer Science vol. 2757 (2003), Springer-Verlag 439-453
13. Kobayashi N., and Suto T. Undecidability of 2-label BPP equivalences and behavioral type systems for the π-calculus. Proceedings of ICALP 2007. Lecture Notes in Computer Science vol. 4596 (2007), Springer-Verlag 740-751
14. Milner R. Communication and Concurrency (1989), Prentice Hall
15. Minsky M.L. Computation: Finite and Infinite Machines (1967), Prentice Hall
16. Park D. Concurrency and automata on infinite sequences. Proceedings 5th GI Conference. Lecture Notes in Computer Science vol. 104 (1981), Springer-Verlag 167-183
17. Rounds W.C., and Brookes S.D. Possible futures, acceptances, refusals, and communicating processes. Annual Symposium on Foundations of Computer Science (FOCS) (1981), IEEE Computer Society Press 140-149
18. Srba J. On the power of labels in transition systems. Proceedings of CONCUR 2001. Lecture Notes in Computer Science vol. 2154 (2001), Springer-Verlag 277-291
19. van Glabbeek R. The linear time-branching time spectrum. In: Baeten J., and Klop J. (Eds). Proceedings of CONCUR'90. Lecture Notes in Computer Science vol. 458 (1990), Springer-Verlag 278-297