Non-interleaving semantics for mobile processes

Theoretical Computer Science

Volumn 216, Issue 1-2, 1999, Pages 237-270

  Degano, Pierpaolo ^a   Priami, Corrado ^a,b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF VERONA   (Italy)

Author keywords

Mobile computing; Operational semantics; True concurrency

Indexed keywords

EID: 0000631298     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)80003-6     Document Type: Article

References (30)

1. C. Bodei, P. Degano, C. Priami, Mobile processes with a distributed environment, in: Proc. ICALP'96, Lecture Notes in Computer Science, vol. 1099, Springer, Berlin, 1996, pp. 490-501.
2. M. Boreale, D. Sangiorgi, A fully abstract semantics of causality in the π-calculus, Acta Inform., to appear.
3. R. Borgia, P. Degano, C. Priami, L. Leth, B. Thomsen, Understanding mobile agents via a non-interleaving semantics for Facile, in: Proc. SAS'96, Lecture Notes in Computer Science, vol. 1145, Springer, Berlin, 1996, pp. 98-112.
4. G. Boudol, I. Castellani, A non-interleaving semantics for CCS based on proved transitions, Fund. Inform. XI (4) (1988) 433-452.
5. G. Boudol, I. Castellani, M. Hennessy, A. Kiehn, A theory of processes with localities, Theoret. Comput. Sci. 114 (1993).
6. N. Busi, R. Gorrieri, A Petri net semantics for π-calculus, in: I. Lee, S.A. Smolka (Eds.), Proc. CONCUR'95, Lecture Notes in Computer Science, vol. 962, Springer, Berlin, 1995, pp. 145-159.
7. Ph. Darondeau, P. Degano, Causal trees, in: Proc. ICALP'89, Lecture Notes in Computer Science, vol. 372, Springer, Berlin, 1989, pp. 234-248.
8. P. Degano, R. De Nicola, U. Montanari, Partial ordering derivations for CCS, in: Proc. FCT, Lecture Notes in Computer Science, vol. 199, Springer, Berlin, 1985, pp. 520-533.
9. P. Degano, R. De Nicola, U. Montanari, A distributed operational semantics for CCS based on condition/event systems, Acta Inform. 26 (1988) 59-91.
10. P. Degano, R. De Nicola, U. Montanari, A partial ordering semantics for CCS, Theoret. Comput. Sci. 75 (1990) 223-262.
11. P. Degano, C. Priami, Proved trees, in: Proc. ICALP'92, Lecture Notes in Computer Science, vol. 623, Springer, Berlin, 1992, pp. 629-640.
12. C. Fournet, G. Gonthier, J-J. Levy, L. Maranget, D. Remy, A calculus of mobile agents, in: Proc. CONCUR'96, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 406-421.
13. A. Giacalone, P. Mishra, S. Prasad, Facile: a symmetric integration of concurrent and functional programming, International J. Parallel Programming 18 (1989) 121-160.
14. L. Jategaonkar, Observing "True" Concurrency, Ph.D. Thesis, MIT, 1993.
15. L. Jategaonkar Jagadeesan, R. Jagadeesan, Causality and true concurrency: a data-flow analysis of the π-calculus, in: Proc. AMAST'95, Lecture Notes in Computer Science, vol. 936, Springer, Berlin, 1995, pp. 277-291.
16. A. Kiehn, Comparing locality and causality based equivalences, Acta Inform. 31 (8) (1994) 697-718.
17. R. Milner, Communication and Concurrency, Prentice-Hall, London, 1989.
18. R. Milner, Action structures, Technical Report ECS-LFCS-92-249, University of Edinburgh, 1992.
19. R. Milner, D. Berry, D. Turner, A semantics for ML concurrency primitives, in: Proc. POPL'92, 1992.
20. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes (I and II), Inform, and Comput. 100 (1) (1992) 1-77.
21. R. Milner, J. Parrow, D. Walker, Modal logics for mobile processes, Theoret. Comput. Sci. 114 (1993) 149-171.
22. U. Montanari, M. Pistore, Concurrent semantics for the π-calculus, in: Electronic Notes in Computer Science, no. 1, Elsevier, Amsterdam, 1995.
23. V. Pratt, Modelling concurrency with partial orders, Internat. J. Parallel Programming 15 (1986) 33-71.
24. C. Priami, D. Yankelevich, Read-write causality, in: Proc. MFCS'94, Lecture Notes in Computer Science, vol. 841, Springer, Berlin, 1994, pp. 567-576.
25. J. Reppy, Higher order concurrency, Ph.D. Thesis, Cornell University, TR 92-1285, 1992.
26. D. Sangiorgi, Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, Ph.D. Thesis, University of Edinburgh, 1992.
27. D. Sangiorgi, Locality and non-interleaving semantics in calculi for mobile processes, in: Proc. TACS'94, Lecture Notes in Computer Science, vol. 789, Springer, Berlin, 1994.
28. B. Thomsen, Plain CHOCS: a second generation calculus for higher order processes, Acta Inform. 30 (1) (1993) 1-59.
29. G. Winskel, Petri nets, algebras, morphisms and compositionality, Inform. and Comput. 72 (1987) 197-238.
30. G. Winskel, M. Nielsen, Models for concurrency, in: Handbook of Logic in Computer Science, Oxford University Press, Oxford, 1995.