The Receptive Distributed $\pi$-Calculus - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2000

The Receptive Distributed $\pi$-Calculus

Résumé

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.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-4080.pdf (477.07 Ko) Télécharger le fichier

Dates et versions

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

Identifiants

  • HAL Id : inria-00072553 , version 1

Citer

Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine. The Receptive Distributed $\pi$-Calculus. [Research Report] RR-4080, INRIA. 2000. ⟨inria-00072553⟩
131 Consultations
303 Téléchargements

Partager

Gmail Facebook X LinkedIn More