Encoding distributed areas and local communication into the π-calculus

Electronic Notes in Theoretical Computer Science

Volumn 52, Issue 1, 2002, Pages 101-119

  Chothia, Tom ^a   Stark, Ian ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; COMMUNICATION CHANNELS (INFORMATION THEORY); CONFORMAL MAPPING; CONTROL EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION THEORY; INTERNET; LINEAR ALGEBRA; PACKET NETWORKS; SEMANTICS; SUPERVISORY AND EXECUTIVE PROGRAMS;

INTERNET SERVICES; LOCAL COMMUNICATIONS; NETWORK ADDRESS TRANSLATION (NAT); REBROADCAST PACKETS;

ENCODING (SYMBOLS);

EID: 19144362376     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00219-1     Document Type: Conference Paper

References (24)

1. Roberto Amadio, Ilaria Castellani, Davide Sangiorgi. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science. 195:1998;291-324
2. Gérard Boudol. Asynchrony and the π-calculus. Rapport de recherche 1702, INRIA, Sophia Antipolis, 1992.
3. Gérard Boudol, Ilaria Castellani, Davide Sangiorgi. Observing localities. Theoretical Computer Science. 114:1993;31-61
4. Gérard Boudol, Ilaria Castellani, Davide Sangiorgi. A theory of processes with localities. Formal Aspects of Computing. 6:1994;165-200
5. Luca Cardelli, Giorgio Ghelli, and Andrew D. Gordon. Secrecy and group creation. In CONCUR '2000: Concurrency Theory. Proceedings of the 11th International Conference, Lecture Notes in Computer Science 1877, pages 365-379. Springer-Verlag, 2000.
6. Luca Cardelli and Andrew D. Gordon. Mobile ambients. In Foundations of Software Science and Computation Structure: Proceedings of FoSSaCS '98, Lecture Notes in Computer Science 1378, pages 140-155. Springer-Verlag, 1998.
7. Giuseppe Castagna, Jan Vitek. Seal: A framework for secure mobile computations. Internet Programming Languages, Lecture Notes in Computer Science 1686. 1999;47-77 Springer-Verlag
8. Tom Chothia and Ian Stark. A distributed π-calculus with local areas of communication. In Proceedings of HLCL '00: High-Level Concurrent Languages, Electronic Notes in Theoretical Computer Science 41.2. Elsevier, 2001.
9. Cédric Fournet, Jean-Jacques Lévy, and Alain Schmitt. An asynchronous distributed implementation for mobile ambients. In Theoretical Computer Science: Proceedings of TCS 2000, Lecture Notes in Computer Science 1872, pages 348-364. Springer-Verlag, August 2000.
10. Matthew Hennessy and James Riely. Resource access control in systems of mobile agents. In Proceedings of HLCL '98: High-Level Concurrent Languages, Electronic Notes in Theoretical Computer Science 16.3, pages 3-17. Elsevier, 1998.
11. Kohei Honda and Mario Tokoro. An object calculus for asynchronous communication. In ECOOP '91: Proceedings of the European Conference on Object-Oriented Programming, Lecture Notes in Computer Science 512, pages 133-147. Springer-Verlag, July 1991.
12. IANA, the Internet Assigned Numbers Authority. Protocol numbers and assignment services: Port numbers. http://www.iana.org/numbers.html#P.
13. Massimo Merro. Locality in the π-calculus and applications to distributed objects. PhD thesis, Ecole des Mines, France, October 2000.
14. Robin Milner. The polyadic π-calculus-a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, University of Edinburgh, 1991.
15. Robin Milner, Joachim Parrow, David Walker. A calculus of mobile processes, parts I and II. Information and Computation. 100:1992;1-77
16. Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. BRICS report RS-99-42, Department of Computer Science, University of Aarhus, December 1999. To appear in Information and Computation; a version appeared as a paper at CONCUR '96.
17. Benjamin Pierce, Davide Sangiorgi. Behavioral equivalence in the polymorphic pi-calculus. Journal of the ACM. 47:(5):September 2000;531-584
18. James Riely and Matthew Hennessy. Distributed processes and location failures. In Automata, Languages and Programming: Proceedings of the 24th International Colloquium ICALP '97, Lecture Notes in Computer Science 1256, pages 471-481. Springer-Verlag, 1997.
19. Davide Sangiorgi. Lazy functions and mobile processes. Rapport de recherche 2515, INRIA, Sophia Antipolis, 1995.
20. Davide Sangiorgi. Locality and non-interleaving semantics in calculi for mobile processes. Theoretical Computer Science. 155:1996;39-83
21. Peter Sewell. Global/local subtyping and capability inference for a distributed π-calculus. In Automata, Languages and Programming: Proceedings of the 25th International Colloquium ICALP 98, Lecture Notes in Computer Science 1442. Springer-Verlag, 1998.
22. David Turner. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, Laboratory for Foundations of Computer Science, Edinburgh University, 1996
23. Also published as LFCS Technical Report 345.
24. José-Luis Vivas and Mads Dam. From higher-order π-calculus to π-calculus in the presence of static operators. In CONCUR '98: Concurrency Theory. Proceedings of the 9th International Conference, Lecture Notes in Computer Science 1466. Springer-Verlag, 1998.