A fully abstract semantics for causality in the π-calculus

Acta Informatica

Volumn 35, Issue 5, 1998, Pages 353-388

  Boreale, Michele ^a   Sangiorgi, Davide ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039835250     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050124     Document Type: Article

References (29)

1. L. Aceto: History preserving, Causal and Mixed-Ordering Equivalence over Stable Event Structure (Note), in Fundamentae Informaticae 17(4):319-331, 1992
2. L. Aceto: Relating Distributed, Temporal and Causal Observations of Simple Processes, in Fundamentae Informaticae 17(4):369-397, 1992
3. S. Arun-Kumar, M. Hennessy: An efficiency preorder for processes. Acta Informatica 29:737-760, 1992
4. G. Boudol: Asynchrony and the π-calculus. Technical Report 1702, INRIA Sophia Antipolis, 1992
5. G. Boudol, I. Castellani, M. Hennessy, A. Kiehn: A theory of processes with localities. TR 13/91, University of Sussex, 1991. To appear in Formal Aspects of Computing
6. M. Boreale, R. De Nicola: Testing equivalence for mobile processes. Information and Computation 120: 279-303, 1995
7. M. Boreale, D. Sangiorgi: Some congruence properties for π-calculus bisimilarities. Technical Report RR-2870, INRIA-Sophia Antipolis, 1996
8. F. Corradini, 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, R. De Nicola, U. Montanari: Partial Ordering Descriptions and Observations of Concurrent Processes, in Linear Time, Branching Time and Partial Order in Logics and Models of Concurrency. Lecture Notes in Computer Science, vol. 354, pp. 438-466. Berlin, Heidelberg, New York: Springer 1988
10. P. Degano, R. De Nicola, U. Montanari: Observation Trees, in Proc. North American Conference on Process Algebras (NAPAW) '92. Berlin, Heidelberg, New York: Springer 1993
11. P. Degano, P. Darondeau: Causal trees. In 15th ICALP. Lecture Notes in Computer Science, vol. 374, pp. 234-248. Berlin, Heidelberg, New York: Springer 1989
12. P. Degano, C. Priami: Proved trees. In: W. Kuich (ed.) Proc. ICALP 92. Lecture Notes in Computer Science, vol. 623. Berlin, Heidelberg, New York: Springer 1992
13. K. Honda, M. Tokoro: On asynchronous communication semantics. In M. Tokoro, O. Nierstrasz, P. Wegner, A. Yonezawa (eds.) ECOOP '91 Workshop on Object Based Concurrent Programming, Geneva, Switzerland, 1991 Lecture Notes in Computer Science, vol. 612, pp. 21-51. Berlin, Heidelberg, New York: Springer 1992
14. A. Kiehn: Comparing locality and causality based equivalences. Acta Informatica 31:697-718 (1994). Revision of Local and global causes, report TUM-19132, 1991
15. A. Kiehn: Proof systems for cause based equivalences. In: Proc. MFCS 93. Lecture Notes in Computer Science, vol. 711. Berlin, Heidelberg, New York: Springer 1993
16. R. Milner: Communication and Concurrency. Prentice Hall, 1989
17. R. Milner: The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ., October 1991
18. R. Milner, J. Parrow, D. Walker: A calculus of mobile processes, (Parts I and II). Information and Computation 100:1-77, 1992
19. M. Montanari, D. Yankelevich: A parametric approach to localities. In: W. Kuich (ed.) Proc. ICALP 92. Lecture Notes in Computer Science, vol. 623, pp. 617-628. Berlin, Heidelberg, New York: Springer 1992
20. D.M. Park: Concurrency on automata and infinite sequences. In: P. Deussen (ed.) Conf. on Theoretical Computer Science. Lecture Notes in Computer Science, vol. 104. Berlin, Heidelberg, New York: Springer 1981
21. J. Parrow, D. Sangiorgi: Algebraic theories for name-passing calculi. Information and Computation 120(2):174-197, 1 August 1995
22. C. Priami. Enhanced Operational Semantics for Concurrency. PhD thesis TD-8/96, Department of Computer Science, University of Pisa, 1996
23. D. Sangiorgi: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, Department of Computer Science, University of Edinburgh, 1992
24. D. Sangiorgi: A theory of bisimulation for the π-calculus. Acta Informatica 33:69-97 (1996)
25. D. Sangiorgi: On the bisimulation proof method. To appear in Journal of Mathematical Structures in Computer Science. (A summary appeared in Proc. MFCS'95, Lecture Notes in Computer Science, vol. 969. Berlin, Heidelberg, New York: Springer 1995)
26. D. Sangiorgi: Locality and non-interleaving semantics in calculi for mobile processes. Theoretical Computer Science 155:39-83, 1996
27. D. Sangiorgi: π-calculus, internal mobility and agent-passing calculi Theoretical Computer Science 167(2):235-274, 1996
28. D. Sangiorgi, R. Milner: The problem of "Weak Bisimulation up to". In: W.R. Cleveland (ed.) Proceedings of CONCUR '92. Lecture Notes in Computer Science, vol. 630, pp. 32-46. Berlin, Heidelberg, New York: Springer 1992
29. D. Walker: Objects in the π-calculus. Information and Computation 116(2):253-271, 1995