On the decidability of process equivalences for the π-calculus

Theoretical Computer Science

Volumn 183, Issue 2, 1997, Pages 215-228

  Dam, Mads ^a  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATIONAL METHODS; COMPUTER NETWORKS; COMPUTERS; MOBILE TELECOMMUNICATION SYSTEMS;

DECIDABILITY;

COMPUTER SCIENCE;

EID: 0347307462     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00325-8     Document Type: Article

References (15)

1. R. Amadio, A uniform presentation of CHOCS and π-calculus, Rapport de Recherche 1726, INRIA-Lorraine, Nancy, 1992.
2. M. Dam, Model checking mobile processes, Inform. Comput. 129 (1996) 35-51.
3. M. Hennessy and H. Lin, Symbolic bisimulations, Report 1/92, Dept. of Computer Science, University of Sussex, 1992.
4. B. Jonsson and J. Parrow, Deciding bisimulation equivalences for a class of non-finite-state programs, Inform. Comput. 107 (1993) 272-302.
5. P.C. Kannellakis and S.A. Smolka, CCS expressions, finite state processes, and three problems of equivalence, Inform. Comput. 86 (1990) 43-68.
6. R. Milner, The polyadic π-calculus: a tutorial, Tech. Report ECS-LFCS-91-180, Laboratory for the Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1991.
7. R. Milner, Functions as processes, Math. Struct. Comput. Sci. 2 (1992) 119-141.
8. R. Milner, J. Parrow and D. Walker, A calculus of mobile processes, I and II, Inform. Comput. 100 (1992) 1-40 and 41-77.
9. R. Milner, J. Parrow and D. Walker, Modal logics for mobile processes, Theoret. Comput. Sci. 114 (1993) 149-171.
10. F. Orava, On the formal analysis of telecommunication protocols, Ph.D. Thesis, Dept. of Computer Systems, Uppsala University and Swedish Institute of Computer Science, 1994.
11. F. Orava and J. Parrow, An algebraic verification of a mobile network, Formal Aspects Comput. 4 (1992) 497-543.
12. R. Paige and R.E. Tarjan, Three partition refinement algorithms, SIAM J. Comput. 16 (1987) 973-989.
13. D. Sangiorgi, From π-calculus to higher-order π-calculus - and back, in: Proc. TAPSOFT'93, Lecture Notes in Computer Science, Vol. 668 (Springer, Berlin, 1993).
14. D. Sangiorgi, A theory of bisimulation for the π-calculus, in: Proc. CONCUR'93, Lecture Notes in Computer Science, Vol. 715 (Springer, Berlin, 1993) 127-142.
15. D. Walker, Objects in the π-calculus, Inform. Comput. 116 (1995) 253-271.