zbMATH — the first resource for mathematics

Probabilistic extensions of process algebras. (English) Zbl 1062.68081
Bergstra, Jan A. (ed.) et al., Handbook of process algebra. Amsterdam: North-Holland/ Elsevier (ISBN 0-444-82830-3). 685-710 (2001).
The concepts of Probabilistic Transition System (PTS), probabilistic bisimulation and simulation are discussed. The PTS are interpreted as a basic model for probabilistic processes. Some of their properties and variants are given. It is shown that PTS are an essentially nondeterministic version of Markov’s decision processes or Rabin’s probabilistic automata. Probabilistic process languages for PTS are discussed. The paper contains a review of the results in this area.
For the entire collection see [Zbl 0971.00006].

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)