The receptive distributed \(\pi\)-calculus. (Extended abstract). (English) Zbl 0958.68117

Pandu Rangan, C. (ed.) et al., Foundations of software technology and theoretical computer science. 19th conference, Chennai, India, December 13-15, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1738, 304-315 (1999).
Summary: We study an asynchronous distributed \(\pi\)-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 \(\pi_1\)-calculus, up to weak asynchronous bisimulation.
For the entire collection see [Zbl 0931.00044].


68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
03B44 Temporal logic