Names of the π-calculus agents handled locally

Theoretical Computer Science

Volumn 253, Issue 2, 2001, Pages 155-184

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

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF VERONA   (Italy)

Author keywords

Agents; Concurrency; Distributed environments; Mobility

Indexed keywords

COMPUTER SIMULATION; EQUIVALENCE CLASSES; SEMANTICS;

CONCURRENCY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0034912599     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00093-1     Document Type: Article

References (30)

1. G.A. Agha, Actors: A Model of Concurrent Computation in Distributed Systems, MIT Press, Cambridge, MA, 1988.
2. R.M. Amadio, An asynchronous model of locality, failure, and process mobility, in: Proc. COORDINATION'97, Lecture Notes in Computer Science, vol. 1282, Springer, Berlin, 1997.
3. J.S. Ambler, A de Bruijn notation for the π-calculus, Technical Report 569, Department of Computer Science, Queen Mary & Westfield College, London, 1991.
4. M. Boreale, D. Sangiorgi, A fully abstract semantics of causality in the π-calculus, in: Proc. STACS'95, Lecture Notes in Computer Science, Vol. 900 Springer, Berlin, 1995.
5. R. Borgia, P. Degano, C. Priami, L. Leth, B. Thomsen, Understanding mobile agents via a non-interleaving semantics for Facile, in: R. Cousot, D.A. Schmidt (Eds.), Proc SAS'96, Lecture Notes in Computer Science, vol. 1145, Springer, Berlin, 1996, pp. 98-112.
6. G. Boudol, I. Castellani, M. Hennessy, A. Kiehn, observing localities, Theoret. Comput. Sci. 114 (1993) 31-61.
7. L. Cardelli, A language with distributed scope, Comput. Systems 8 (1) (1995) 27-59.
8. L. Cardelli, A.D. Gordon, Mobile ambients, in: Maurice Nivat (Ed.), Foundations of Software Science and Computational Structures, Lecture Notes in Computer Science, vol. 1378, Springer, Berlin, 1998, pp. 140-155.
9. R. Cleaveland, D. Yankelevich, An operational framework for value-passing processes, Proc. POPL'94, 1994, pp. 326-338.
10. Ph. Darondeau, P. Degano, Causal trees, in: Proc. ICALP'89, Lecture Notes in Computer Science, vol. 372, Springer, Berlin, 1989, pp. 234-248.
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. P. Degano, C. Priami, Non interleaving semantics for mobile processes, Extended abstract, in: Proc. ICALP'95, Lecture Notes in Computer Science, vol. 944, Springer, Berlin, 1995, pp. 660-671, Theoret. Comput. Sci., 216 (1999) 237-270.
13. P. Degano, C. Priami, Non interleaving semantics for mobile processes, Extended abstract, in: Proc. ICALP'95, Lecture Notes in Computer Science, vol. 944, Springer, Berlin, 1995, pp. 660-671, Theoret. Comput. Sci., 216 (1999) 237-270.
14. C. Fournet, Gonthier, The reflexive chemical abstract machine and the join calculus, Proc. 23rd ACM Symp. on Principles of Programming Languages, 1996.
15. A. Giacalone, P. Mishra, S. Prasad, Operational and algebraic semantics for Facile: a symmetric integration of concurrent and functional programming, in: Proc. ICALP'90, Lecture Notes in Computer Science, vol. 443, Springer, Berlin, 1990, pp. 765-780.
16. D. Gilbert, C. Palamidessi, A calculus of process migration, Technical Report, 1997.
17. K. Honda, M. Tokoro, A small calculus for concurrent objects, OOPS Messenger 2 (2) (1991) 50-54.
18. S. Mac Lane, Categories for the Working Mathematician, Springer, Berlin, 1971.
19. R. Milner, The polyadic π-calculus: a tutorial, Technical Report ECS-LFCS-91-180, University of Edinburgh, 1991.
20. R. Milner, D. Berry, D. Turner, A semantics for ML concurrency primitives, Proc. POPL'92, 1992.
21. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes (I and II), Inform. Comput. 100 (1) (1992) 1-77.
22. R. Milner, J. Parrow, D. Walker, Modal logics for mobile processes, Theoret. Comput. Sci. 114 (1993) 149-171.
23. F. Orava, J. Parrow, An algebraic verification of a mobile network, Formal Aspects Comput. 4 (1992) 497-543.
24. T.W. Pratt, Programming Languages: Design and Implementation, Prentice Hall, Englewood Cliffs, NJ, 1984.
25. J. Reppy, Higher order concurrency, Ph.D. Thesis, Cornell University, Ithaca, NY, 1992, TR 92-1285.
26. D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D. Thesis, University of Edinburgh, 1992.
27. D. Sangiorgi, in: 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. B. Thomsen, L. Leth, S. Prasad, T.-M. Kuo, A. Kramer, F. Knabe, A. Giacalone, Facile antigua release programming guide, Technical Report ECRC-93-20, European Computer-Industry Research Centre, 1993.
30. D. Walker, Objects in the π-calculus, Inform. Comput. 116 (2) (1995) 253-271.