Locality and interleaving semantics in calculi for mobile processes

Theoretical Computer Science

Volumn 155, Issue 1, 1996, Pages 39-83

  Sangiorgi, Davide ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; MATHEMATICAL OPERATORS;

INTERLEAVING SEMANTICS; LOCATION BISIMULATION; NONINTERLEAVING SEMANTICS; OBSERVATION EQUIVALENCE; PROCESS ALGEBRA;

COMPUTATIONAL LINGUISTICS;

EID: 0030083213     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00020-8     Document Type: Article

References (33)

1. L. Aceto, A static view of localities, Rapport de Recherche 1483, INRIA-Sophia Antipolis, 1991; Formal Aspects of Computing, to appear.
2. L. Aceto, A static view of localities, Rapport de Recherche 1483, INRIA-Sophia Antipolis, 1991; Formal Aspects of Computing, to appear.
3. S. Arun-Kumar and M. Hennessy, An efficiency preorder for processes, Acta Inform., 29 (1992) 737-760.
4. M. Boreale and D. Sangiorgi, A fully abstract semantics for causality in the π-calculus, Technical Report ECS-LFCS-94-297, LFCS, Dept. of Comput. Sci., Edinburgh Univ., 1994.
5. G. Boudol, I. Castellani, M. Hennessy and A. Kiehn, Observing localities, Theoret. Comput. Sci., 114 (1993) 31-61.
6. G. Boudol, I. Castellani, M. Hennessy and A. Kiehn, A theory of processes with localities, Formal Aspects of Computing 6 (1994) 165-200.
7. I. Castellani, Observing distribution in processes, in: Proc. MFCS 93, Vol. 711 (Springer, Berlin, 1993) 321-331.
8. F. Corradini and R. De Nicola, Locality and causality in distributed process algebras, Report SI/R/R-93/05, Dipartimento di Scienze dell'Informazione, Università degli studi di Roma La Sapienza, 1993.
9. P. Degano and P. Darondeau, Causal trees, in: 15th ICALP, Lecture Notes in Computer Science, Vol. 372 (Springer, Berlin, 1989) 234-248.
10. P. Degano, R. De Nicola and U. Montanari, Observational equivalences for concurrency models, in: Proc. 3rd IFIP WG 2.2 Working Conf. (North-Holland, Amsterdam, 1987) 105-129.
11. P. Degano, R. De Nicola and U. Montanari, Universal axioms for bisimulation, Theoret. Comput. Sci. 114 (1993) 63-91.
12. P. Degano and C. Priami, Proved trees, in: W. Kuich, ed., Proc. ICALP 92, Lecture Notes in Computer Science, Vol. 623 (Springer, Berlin, 1992).
13. J. Engelfriet, A multiset semantics for the π-calculus with replication, in: E. Best, ed., Proc. CONCUR'93, Vol. 715 (Springer, Berlin, 1993) 7-21.
14. R.J. van Glabbeek and F.W. Vaandrager, Petri nets models for algebraic theories of concurrency, in: Proc. PARLE Conf., Lecture Notes in Computer Science, Vol. 259 (Springer, Berlin, 1987).
15. n-bisimulations for CCS agents, in: Proc. MFCS 91, Lecture Notes in Computer Science, Vol. 520 (Springer, Berlin, 1991) 170-180.
16. A. Kiehn, Local and global causes, Technical Report 342/23/91, Technische Universität München, 1991.
17. R. Milner, Communication and Concurrency (Prentice-Hall, Eaglewood Cliffs, NJ, 1989).
18. R. Milner, The polyadic π-calculus: a tutorial, Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comput. Sci., Edinburgh Univ., October 1991; also in: F.L. Bauer, W. Brauer and H. Schwichtenberg, eds., Logic and Algebra of Specification (Springer, Berlin, 1993).
19. R. Milner, The polyadic π-calculus: a tutorial, Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comput. Sci., Edinburgh Univ., October 1991; also in: F.L. Bauer, W. Brauer and H. Schwichtenberg, eds., Logic and Algebra of Specification (Springer, Berlin, 1993).
20. R. Milner, Functions as processes, J. Math. Struct. Comput. Sci. 2 (1992) 119-141.
21. R. Milner, J. Parrow and D. Walker, A calculus of mobile processes (Parts I and II), Inform. and Comput., 100 (1992) 1-77.
22. M. Montanari and D. Yankelevich, A parametric approach to localities, in: W. Kuich, ed., Proc. ICALP 92, Lecture Notes in Computer Science, Vol. 623 (Springer, Berlin, 1992) 617-628.
23. M. Mukund and M. Nielsen, CCS, locations and asynchronous transition systems, in: Proc. FST-TCS 92, Lecture Notes in Computer Science, Vol. 652 (Springer, Berlin, 1992) 328-341.
24. D. Murphy, Observing located concurrency, in: Proc. MFCS 93, Lecture Notes in Computer Science, Vol. 711 (Springer, Berlin, 1993) 566-576.
25. J. Parrow and D. Sangiorgi, Algebraic theories for name-passing calculi, Technical Report ECS-LFCS-93-262, LFCS, Dept. of Comput. Sci., Edinburgh Univ., 1993; Inform. and Comput. to appear; short version in Proc. REX Summer School/Symp. 1993, Lecture Notes in Computer Science, Vol. 803 (Springer, Berlin, 1993).
26. J. Parrow and D. Sangiorgi, Algebraic theories for name-passing calculi, Technical Report ECS-LFCS- 93-262, LFCS, Dept. of Comput. Sci., Edinburgh Univ., 1993; Inform. and Comput. to appear; short version in Proc. REX Summer School/Symp. 1993, Lecture Notes in Computer Science, Vol. 803 (Springer, Berlin, 1993).
27. J. Parrow and D. Sangiorgi, Algebraic theories for name-passing calculi, Technical Report ECS-LFCS- 93-262, LFCS, Dept. of Comput. Sci., Edinburgh Univ., 1993; Inform. and Comput. to appear; short version in Proc. REX Summer School/Symp. 1993, Lecture Notes in Computer Science, Vol. 803 (Springer, Berlin, 1993).
28. D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D. Thesis CST-99-93, Dept. of Comput. Sci., Edinburgh Univ., 1992.
29. D. Sangiorgi, A theory of bisimulation for the π-calculus, Technical Report ECS-LFCS-93-270, LFCS, Dept. of Comput. Sci., Edinburgh Univ., 1993; extended abstract in Proc. CONCUR '93, Lecture Notes in Computer Science, Vol. 715 (Springer, Berlin, 1993).
30. D. Sangiorgi, A theory of bisimulation for the π-calculus, Technical Report ECS-LFCS-93-270, LFCS, Dept. of Comput. Sci., Edinburgh Univ., 1993; extended abstract in Proc. CONCUR '93, Lecture Notes in Computer Science, Vol. 715 (Springer, Berlin, 1993).
31. D. Sangiorgi, On the bisimulation proof method, Technical Report ECS-LFCS-94-299, LFCS, Dept. of Comput. Sci., Edinburgh Univ., 1994.
32. D. Sangiorgi and R. Milner, The problem of "weak bisimulation up to", in: W.R. Cleveland, ed., Proc. of CONCUR '92, Lecture Notes in Computer Science, Vol. 630 (Springer, Berlin, 1992) 32-46.
33. D. Walker, Objects in the π-calculus, Informa. and Comput., to appear.