Abstract
This paper presents a generalization of distributed π-calculi to support a hierarchy of locations. We add nested locations on top of a π-calculus core. By unifying channels and locations, we arrive at a computation model which uses mobile agents to pass addresses among immobile and nested locations. We choose a static binding semantics of addresses to enable easy navigation of mobile agents in the location tree. We support dynamic creation of new locations and garbage-collection of empty ones. A sample typed calculus is presented to demonstrate the formalization of type systems and related proof techniques in this calculus.Comments from Gérard Boudol, Ana Matos, and three anonymous referees improved this paper.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
