HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

On Bisimulations for the Asynchronous pi-calculus

Abstract : 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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073784
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:45:06 PM
Last modification on : Friday, February 4, 2022 - 3:19:30 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:58:12 PM

Identifiers

  • HAL Id : inria-00073784, version 1

Collections

Citation

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

Share

Metrics

Record views

61

Files downloads

306