Expressiveness of probabilistic \pi-calculi - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Expressiveness of probabilistic \pi-calculi


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.
Fichier principal
Vignette du fichier
FinalBis.pdf (210.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00201088 , version 1 (23-12-2007)



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⟩
228 View
66 Download



Gmail Facebook X LinkedIn More