This paper is concerned with finding complete axiomatizations of probabilistic processes.
We examine this problem within the context of the process algebra ACP and obtain as our
endresult the axiom system pr ACP− l, a version of ACP whose main innovation is a
probabilistic asynchronous interleaving operator. Our goal was to introduce probability into
ACP in as simple a fashion as possible, Optimally, ACP should be the homomorphic image
of the probabilistic version in which the probabilities are forgotten, We begin by weakening …

This paper is concerned with finding complete axiomatizations of probabilistic processes.
We examine this problem within the context of the process algebra ACP and obtain as our
end-result the axiom system pr ACP I−-, a probabilistic version of ACP which can be used to
reason algebraically about the reliability and performance of concurrent systems. Our goal
was to introduce probability into ACP in as simple a fashion as possible. Optimally, ACP
should be the homomorphic image of the probabilistic version in which the probabilities are …