Abstract
In this paper we study an asynchronous distributed π-calculus, with constructs for localities and migration. We show that a simple static analysis ensures the receptiveness of channel names, which, together with a simple type system, guarantees that any migrating message will find an appropriate receiver at its destination locality. We argue that this receptive calculus is still expressive enough, by showing that it contains the π1-calculus, up to weak asynchronous bisimulation. © Springer-Verlag Berlin Heidelberg 1999.
Cite
CITATION STYLE
Amadio, R. M., Boudol, G., & Lhoussaine, C. (1999). The receptive distributed π-calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1738, pp. 304–315). Springer Verlag. https://doi.org/10.1007/3-540-46691-6_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
