A complexity analysis of bisimilarity for value-passing processes

Theoretical Computer Science

Volumn 238, Issue 1-2, 2000, Pages 313-345

  Boreale, Michele ^a   Trevisan, Luca ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Bisimulation; Computational complexity; Process algebras; Value passing

Indexed keywords

EID: 0347899698     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00177-7     Document Type: Article

References (19)

1. D.P. Bovet, P. Crescenzi, Introduction to the Theory of Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. M. Boreale, R. De Nicola, A symbolic semantics for the π-calculus - extended abstract, in: B. Jonsson, J. Parrow (Eds.), Proc. Concur '94, Lecture Notes in Computer Science, Vol. 836, Springer, Berlin, 1994, pp. 299-314; Full version: Inform, and Comput. 126 (1996) 34-52.
3. M. Boreale, R. De Nicola, A symbolic semantics for the π-calculus - extended abstract, in: B. Jonsson, J. Parrow (Eds.), Proc. Concur '94, Lecture Notes in Computer Science, Vol. 836, Springer, Berlin, 1994, pp. 299-314; Full version: Inform, and Comput. 126 (1996) 34-52.
4. A.K. Chandra, D.C. Kozen, L.J. Stockmeyer, Alternation, J. ACM 28(1) (1981) 114-133.
5. S.A. Cook, The complexity of theorem proving procedures, Proc. 3rd ACM Symp. on Theory of Computing, 1971, pp. 151-158.
6. J. Hartmanis, R.E. Stearns, On the computational complexity of algorithms, Trans. AMS 117 (1965) 285-306.
7. M. Hennessy, H. Lin, Proof systems for message-passing process algebras, in: E. Best (Ed.), Proc. of CONCUR '93, Lecture Notes in Computer Science, Vol. 715, Springer-Verlag, Berlin, 1993.
8. M. Hennessy, H. Lin, Symbolic bisimulations, Theoret. Compu. Sci. 138 (1995) 353-389.
9. B. Jonsson, J. Parrow, Deciding bisimulation equivalences for a class of non-finite state programs, Inform, and Comput. 107 (1993) 272-302.
10. P.C. Kanellakis, S.A. Smolka, CCS expressions, finite state processes, and three problems of equivalence, Inform, and Comput. 86 (1990) 43-68.
11. R. Milner, A calculus of communicating systems, Lecture Notes in Computer Science, Vol. 92, Springer, Berlin, 1980.
12. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood ciffs, NJ, 1989.
13. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes, Part I and II. Inform, and Comput. 100 (1992) 1-41 and 42-78.
14. R. Paige, R.E. Tarjan, Three partition refinement algorithms, SIAM J. Comput. 16(6) (1987) 973-989.
15. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
16. J. Parrow, D. Sangiorgi, Algebraic theories for name-passing calculi, Inform, and Comput. 120 (2) (1995).
17. D. Sangiorgi, A theory of bisimulation for the π-calculus, in: E. Best (Ed.), Proc CONCUR '93, Lecture Notes in Computer Science, Vol. 715, Springer, Berlin, 1993; Acta Inform. 33 (1996).
18. D. Sangiorgi, A theory of bisimulation for the π-calculus, in: E. Best (Ed.), Proc CONCUR '93, Lecture Notes in Computer Science, Vol. 715, Springer, Berlin, 1993; Acta Inform. 33 (1996).
19. L. Stockmeyer, A. Meyer, Word problems requiring exponential time, Proc. 5th ACM Symp. on Theory of Computing, 1973, pp. 1-9.