The Receptive Distributed $\pi$-Calculus - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2000

The Receptive Distributed $\pi$-Calculus

(1) , (1) , (1)


In this paper 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 a local deadlock-freedom property, that we call message deliverability. This property states that any migrating message will find an appropriate receiver at its destination locality. We argue that this distributed, receptive calculus is still expressive enough, by giving a series of examples illustrating the «receptive style» of programming we have. Finally we show that our calculus contains the $\pi_1$-calculus, up to weak asynchronous bisimulation.
Fichier principal
Vignette du fichier
RR-4080.pdf (477.07 Ko) Télécharger le fichier

Dates and versions

inria-00072553 , version 1 (24-05-2006)


  • HAL Id : inria-00072553 , version 1


Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine. The Receptive Distributed $\pi$-Calculus. [Research Report] RR-4080, INRIA. 2000. ⟨inria-00072553⟩
128 View
288 Download


Gmail Facebook Twitter LinkedIn More