A sound and complete proof system for probabilistic processes



Downloads per month over past year

Cuartero Gómez, Fernando and Frutos Escrig, David de and Valero Ruiz, Valentín (1997) A sound and complete proof system for probabilistic processes. In Transformation-Based Reactive Systems Development : 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software, ARTS'97 Palma, Mallorca, Spain, May 21–23, 1997 Proceedings. Lecture notes in computer science (1231). Springer, pp. 340-352. ISBN 978-3-540-63010-4

[thumbnail of Frutos31springer.pdf]

Official URL: http://link.springer.com/content/pdf/10.1007%2F3-540-63010-4_23


n this paper we present a process algebra model of probabilistic communicating processes based on classical CSP. To define our model we have replaced internal non-determinism by generative probabilistic choices, and external non-determinism by reactive probabilistic choices, with the purpose of maintaining the meaning of the classical CSP operators, once generalized in a probabilistic way. Thus we try to keep valid, as far as possible, the laws of CSP. This combination of both internal and external choice makes strongly difficult the definition of a probabilistic version of CSP. In fact, we can find in the current literature quite a number of papers on probabilistic processes, but only in a few of them internal and external choices are combined, trying to preserve their original meaning.
Starting with a denotational semantics where the corresponding domain is a set of probabilistic trees with two kinds of nodes, representing the internal and external choices, we define a sound and complete proof system, with very similar laws to those of the corresponding CSP.

Item Type:Book Section
Subjects:Sciences > Computer science
ID Code:20770
Deposited On:11 Apr 2013 09:32
Last Modified:02 Sep 2020 09:43

Origin of downloads

Repository Staff Only: item control page