MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Location-independent communication for mobile agents: a two-level architecture (1999) [57 citations — 29 self]

Download:
pdf | ps
by Peter Sewell, Pawe L T. Wojciechowski, Benjamin C. Pierce
In Internet Programming Languages, LNCS 1686
http://www.cis.upenn.edu/~bcpierce/papers/wipl.ps
Add To MetaCart

Abstract:

Abstract. We study communication primitives for interaction between mobile agents. They can be classied into two groups. At a low level there are location dependent primitives that require a programmer to know the current site of a mobile agent in order to communicate with it. At a high level there are location independent primitives that allow communication with a mobile agent irrespective of its current site and of any migrations. Implementation of these requires delicate distributed infrastructure. We propose a simple calculus of agents that allows implementations of such distributed infrastructure algorithms to be expressed as encodings, or compilations, of the whole calculus into the fragment with only location dependent communication. These encodings give executable descriptions of the algorithms, providing a clean implementation strategy for prototype languages. The calculus is equipped with a precise semantics, providing a solid basis for understanding the algorithms and for reasoning about their correctness and robustness. Two sample

Citations

1027 Distributed Algorithm – Lynch - 1996
886 A Calculus of Mobile Processes – Milner, Parrow, et al. - 1992
663 Mobile ambients – Cardelli, Gordon
413 The chemical abstract machine – Berry, Boudol - 1992
284 Mobile agents: Are they a good idea – Harrison, Chess, et al. - 1997
283 An Object Calculus for Asynchronous Communication – Honda, Tokoro - 1991
281 Functions as processes – Milner - 1992
233 Pict: A programming language based on the pi-calculus – Pierce, Turner - 2000
216 CML: A Higher-order Concurrent Language – Reppy - 1991
183 Resource access control in systems of mobile agents – Hennessy, Riely - 1998
145 Concurrent Haskell – Jones, Gordon, et al. - 1996
124 Dynamic Typing in a Statically Typed Language – Abadi, Cardelli, et al. - 1991
93 The polymorphic pi-calculus: Theory and implementation – Turner - 1996
85 A typed language for distributed mobile processes – Riely, Hennessy - 1998
78 Concurrent objects in a process calculus – Pierce, Turner - 1994
64 Global/local subtyping and capability inference for a distributed Ï€calculus – Sewell - 1996
56 Asynchrony and the -calculus (note). Rapport de Recherche 1702 – Boudol - 1992
52 Localities and failures – Amadio, Prasad - 1994
51 Distributed processes and location failures – Riely, Hennessy - 1997
36 A Facile tutorial – Thomsen, Leth, et al. - 1996
34 Type-safe execution of mobile agents in anonymous networks – Hennessy, Riely - 1998
30 Location independence for mobile agents – Sewell, Wojciechowski, et al. - 1998
20 On implementations and semantics of a concurrent programming language – Sewell - 1997
12 Towards a calculus of mobile computations – Vitek, Castagna - 1998
11 Global/local subtyping for a distributed -calculus – Sewell - 1997
7 Modelling IP mobility – Amadio, Prasad - 1998
4 A brief introduction to applied – Sewell - 1999
1 and the amber machine – Amber - 1986
1 core technology user guide, version 2.0 beta 1. Available from http://www.objectspace.com – Voyager - 1997