On the expressiveness of internal mobility in name-passing calculi

Theoretical Computer Science

Volumn 195, Issue 2, 1998, Pages 205-226

  Boreale, Michele ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Barbed equivalence; Bisimulation; calculus

Indexed keywords

EID: 0000203887     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00220-X     Document Type: Article

References (23)

1. R. Amadio, An asynchronous model of locality, failure and process mobility; available at http://protis. univ-mrs.fr/amadio/locfaIII.
2. R. Amadio, I. Castellani, D. Sangiorgi, On bisimulations for the asynchronous π-calculus, Tech. Report RR-2913, INRIA-Sophia Antipolis, 1996. Extended abstract in Proc. Concur'96, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996.
3. Arun-Kumar, M. Hennessy, An efficiency preorder for processes, Acta Inform. 29 (1992) 737-760.
4. M. Boreale, D. Sangiorgi, A fully abstract semantics for causality in the π-calculus, Tech. Report ECS-LFCS-94-297, Dept. of Comp. Sci., Edinburgh University, 1994; Acta Inform., to appear. An extract appeared in Proc. STACS'95, Lecture Notes in Computer Science, vol. 900, Springer, Berlin, 1995.
5. M. Boreale, D. Sangiorgi, Some congruence properties for π-calculus bisimilarities, Tech. Report RR-2870, INRIA-Sophia Antipolis, 1996; Theoret. Comput. Sci., to appear.
6. G. Boudol. Asynchrony and the π-calculus (note), Tech. Report RR-1702, INRIA-Sophia Antipolis, 1992.
7. R. De Nicola, M. Hennessy, Testing equivalence for processes, Theoret. Comput. Sci. 34 (1984) 83-133.
8. G. Ferrari, U. Montanari, P. Quaglia, A π-calculus with explicit substitutions, Theoret. Comput. Sci. 168 (2) (1996) 53-103.
9. C. Fournet, G. Gonthier, The reflexive chemical abstract machine and the join-calculus, in: Proc. 23rd Symp. on Principles of Programming Languages (POPL'96).
10. M. Hansen, J. Kleist, H. Hüttel, Bisimulations for asynchronous mobile processes, in: Proc. Tbilisi Symp. on Language, Logic, and Computation., 1995. Research paper HCRC/RP-72, Human Communication Research Centre, University of Edinburgh.
11. K. Honda, Two bisimilarities for the ν-calculus, Tech. Report 92-002, Department of Computer Science, Keio University, 1992.
12. R. Milner, The polyadic π-calculus: a tutorial, Tech. Report ECS-LFCS-91-180, LFCS, Dept. of Computer Science, Edinburgh Univ., 1991.
13. R. Milner, Functions as processes, Math. Struct. Comput. Sci. 2 (2) (1992) 119-141.
14. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes, Parts I and II, Inform. Comput. 100 (1992) 1-41 and 42-78.
15. U. Nestmann, B.C. Pierce, Decoding choiche encodings, in: Proc. 7th Conf. on Concurrency Theory (CONCUR'96), Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 179-194.
16. J. Parrow, D. Sangiorgi, Algebraic theories for name-passing calculi, Inform. Comput. 120 (2) (1995) 174-197.
17. B. Pierce, D. Sangiorgi, Typing and subtyping for mobile processes, Math. Struct. Comput. Sci. 11 (1995).
18. D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D. Thesis, Department of Computer Science, University of Edinburgh, 1992.
19. D. Sangiorgi, Locality and non-interleaving semantics in calculi for mobile processes, Tech. Report ECS-LFCS-94-282, LFCS, Dept. of Computer Science, Edinburgh University. 1994. An extract appeared in Proc. TACS'94, Lecture Notes in Computer Science, Springer, Berlin, 1994.
20. D. Sangiorgi, Lazy functions and mobile processes, Tech. Report RR-2515, INRIA, 1995.
21. D. Sangiorgi, A theory of bisimulation for the π-calculus, Acta Inform. 33 (1996) 69-97.
22. D. Sangiorgi, π-calculus, internal mobility, and agent-passing calculi, Theoret. Comput. Sci. 167 (2) (1996) 235-274.
23. D. Sangiorgi, R. Milner, The problem of "Weak Bisimulation up-to", in: W.R. Cleveland (Ed.), Proc. CONCUR'92, vol. 630, Springer, Berlin, 1992, pp. 32-46.