Skip to Main content Skip to Navigation
Conference papers

Fair Pi

Diletta Cacciagrano 1 Flavio Corradini 1 Catuscia Palamidessi 2
2 COMETE - Concurrency, Mobility and Transactions
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Catuscia Palamidessi <>
Submitted on : Saturday, December 22, 2007 - 8:54:54 AM
Last modification on : Thursday, March 5, 2020 - 6:18:29 PM
Long-term archiving on: : Tuesday, April 13, 2010 - 3:13:46 PM


Files produced by the author(s)




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⟩



Record views


Files downloads