Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
423880 | Electronic Notes in Theoretical Computer Science | 2007 | 20 Pages |
Abstract
This paper proposes two semantics of a probabilistic variant of the π-calculus: an interleaving semantics in terms of Segala automata and a true concurrent semantics, in terms of probabilistic event structures. The key technical point is a use of types to identify a good class of non-deterministic probabilistic behaviours which can preserve a compositionality of the parallel operator in the event structures and the calculus. We show an operational correspondence between the two semantics. This allows us to prove a “probabilistic confluence” result, which generalises the confluence of the linearly typed π-calculus.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics