Complexity of Equivalence Problems for Concurrent Systems of Finite Agents

Information and Computation

Volumn 139, Issue 2, 1997, Pages 111-129

  Rabinovich, Alexander ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001452222     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2661     Document Type: Article

References (21)

1. Alvarez, C., Balcazar, J., Gabarro, J., and Santa, M. (1992), Parallel Complexity in the design and analysis of concurrent systems, in "Formal Aspects of Computing," Vol. 4, No. 6A.
2. Bloom, B. (1990), "Ready Simulation, Bisimulation, and the Semantics of CCS-Like Languages," Ph.D. Thesis, Technical Report MIT/LCS/TR-491.
3. Brookes, S., Hoare, C., and Roscoe, A. (1984), A theory of communicating sequential processes, J. Assoc. Comput. Mach. 31(3), 560-599.
4. van Glabbeek, R. (1993), The linear time -branching time spectrum, in "CONCUR 93," Lect. Notes in Computer Science, Vol. 715, pp. 60-81, Springer Verlag, Berlin.
5. Groote, J. F., and Moller, F. (1992), Verification of parallel system via decomposition, in "Proc. of Third Conference on Concurrency Theory," Lect. Notes in Computer Science, Vol. 630, pp. 62-76, Springer Verlag, Berlin.
6. Groote, J. F., and Vaandrager, F. (1990), An efficient algorithm for branching bisimulation and stuttering equivalence, in "International Conference on Automata, Languages and Programming," Lect. Notes in Computer Science, Vol. 443, Springer Verlag, Berlin.
7. Hennessy, M. (1988), "Algebraic Theory of Processes," MIT Press, Cambridge, MA.
8. Hoare, C., (1985), "Communicating Sequential Processes," Prentice-Hall, Englewood Cliffs, NJ.
9. Hopcroft, J., and Ullman, J. (1979), "Introduction to Automata Theory, Languages and Computations," Addison-Wesley, Reading, MA.
10. Jategaonkar, L. (1993), "Observing "True" Concurrency," Ph.D. Thesis, Technical Report MIT/LCS/TR-618.
11. Mayer, A. J., and Stockmeyer, L. J. (1994), The complexity of world problems, this time with interleaving, Inform. and Comput. 115, 293-311.
12. Meyer, A. R., and Stockmeyer, L. J. (1972), The equivalence problem for regular expressions with squaring requires exponential space, in "Proc. 13th IEEE Symp. on Switching and Automata Theory," pp. 125-129.
13. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, Englewood Cliffs, NJ.
14. Kanellakis, P. C., and Smolka, S. A. (1990), CCS expressions, finite state processes, and three problems of equivalence, Inform. and Comput. 86.
15. Paige, R., and Tarjan, R. (1987), Three partition refinement algorithms, SIAM J. Comput. 16(6), 973-989.
16. Park, D., (1981), "Concurrency and Automata on Infinite Sequences," Lect. Notes in Computer Science, Vol. 104, Springer Verlag, Berlin.
17. Plotkin, G. (1981), "A Structured Approach to Operational Semantics," FN 19 DAIMI, Aarhus Univ.
18. Rabinovich, A. (1992), Checking equivalences between concurrent systems of finite agents, in "International Conference on Automata, Languages and Programming," Lect. Notes in Computer Science, Vol. 623, pp. 696-707, Springer Verlag, Berlin.
19. Shulka, S. K., Hunt, H. B., Rosenkratz, D. J., and Stearn, R. E. (1996), "On the Complexity of Relational Problems for Finite State Processes," Lect. Notes in Computer Science, Vol. 1099, pp. 466-477, Springer-Verlag, Berlin.
20. Stockmeyer, L. J., and Meyer, A. R. (1973), Word problems requiring exponential time, in "Proc. 5th ACM Symp. on Theory of Computing," pp. 1-9.
21. Stockmeyer, L. J. (Jan. 1992), Private communication.