Fair Pi - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Fair Pi


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
Origin Files produced by the author(s)

Dates and versions

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



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⟩
167 View
51 Download



Gmail Mastodon Facebook X LinkedIn More