Fair Pi - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Fair Pi

Résumé

In this paper, we define fair computations in the pi-calculus. We follow Costa and Stirling's approach for CCS-like languages but exploit a more natural labeling method of process actions to filter out unfair process executions. The new labeling allows us to prove all the significant properties of the original one, such as unicity, persistence and disappearance of labels. It also turns out that the labeled pi-calculus is a conservative extension of the standard one. We contrast the existing fair testing with those that naturally arise by imposing weak and strong fairness as defined by Costa and Stirling. This comparison provides the expressiveness of the various fair testing-based semantics and emphasizes the discriminating power of the one already proposed in the literature.
Fichier principal
Vignette du fichier
express06.pdf (298.23 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00200937 , version 1 (22-12-2007)

Identifiants

Citer

Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi. Fair Pi. 13th International Workshop on Expressiveness in Concurrency (EXPRESS'06), Aug 2006, Bonn, Germany. pp.3-26, ⟨10.1016/j.entcs.2007.04.010⟩. ⟨inria-00200937⟩
164 Consultations
48 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More