On Bisimulations for the Asynchronous pi-calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1996

On Bisimulations for the Asynchronous pi-calculus

Ilaria Castellani
  • Function : Author
  • PersonId : 831542
Davide Sangiorgi
  • Function : Author


The {\em asynchronous $\pi$-calculus\/} is a variant of the $\pi$-calculus where message emission is non-blocking. Honda and Tokoro have studied a semantics for this calculus based on bisimulation. Their bisimulation relies on a modified transition system where, at any moment, a process can perform any input action. In this paper we propose a new notion of bisimulation for the asynchronous $\pi$-calculus, defined on top of the standard labelled transition system. We give several characterizations of this equivalence including one in terms of Honda and Tokoro's bisimulation, and one in terms of %a natural {\em barbed equivalence}. We show that this bisimulation is preserved by name substitutions, hence by input prefix. Finally, we give a complete axiomatization of the (strong) bisimulation for finite terms.
Fichier principal
Vignette du fichier
RR-2913.pdf (465.09 Ko) Télécharger le fichier

Dates and versions

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


  • HAL Id : inria-00073784 , version 1


Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi. On Bisimulations for the Asynchronous pi-calculus. RR-2913, INRIA. 1996. ⟨inria-00073784⟩
71 View
347 Download


Gmail Facebook Twitter LinkedIn More