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.
Type de document :
Rapport
RR-2913, INRIA. 1996
Liste complète des métadonnées

https://hal.inria.fr/inria-00073784
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:45:06
Dernière modification le : samedi 27 janvier 2018 - 01:31:31
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:58:12

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

113

Téléchargements de fichiers

244