Towards A Tree of Channels
Abstract
This paper presents a generalization of distributed $pi$-calculi to support a hierarchy of locations. We add nested locations on top of a $pi$-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.
@Article\{guan:towards-tree,
author = \{X. Guan},
title = \{Towards A Tree of Channels},
journal = \{ENTCS},
year = \{2003},
volume = \{85},
number = \{1},
url = \{http://mikado.di.fc.ul.pt/repository/guan_towards-tree.pdf}
}
About this site. Last modified: Wed Mar 4 17:56:15 CET 2020