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
Conference papers

Expressiveness of probabilistic \pi-calculi

Sylvain Pradalier 1 Catuscia Palamidessi 1
1 COMETE - Concurrency, Mobility and Transactions
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : In this work we propose a probabilistic extension of the -calculus. The main novelty is a probabilistic mixed choice operator, that is, a choice construct with a probability distribution on the branches, and where input and output actions can both occur as guards. We develop the operational semantics of this calculus, and then we investigate its expressiveness. In particular, we compare it with the sublanguage with the two separate choices, where input and output guards are not allowed together in the same choice construct. Our main result is that the separate choices can encode the mixed one. Further, we show that input-guarded choice can encode output-guarded choice and viceversa. In contrast, we conjecture that neither of them can encode the pair of the two separate choices.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

Contributor : Catuscia Palamidessi Connect in order to contact the contributor
Submitted on : Sunday, December 23, 2007 - 12:43:17 PM
Last modification on : Thursday, January 20, 2022 - 4:12:24 PM
Long-term archiving on: : Thursday, September 27, 2012 - 1:21:38 PM


Files produced by the author(s)




Sylvain Pradalier, Catuscia Palamidessi. Expressiveness of probabilistic \pi-calculi. 4th International Workshop on Quantitative Aspects of Programming Languages (QAPL), Apr 2006, Vienna, Austria. ⟨10.1016/j.entcs.2006.07.015⟩. ⟨inria-00201088⟩



Record views


Files downloads