Extends imperative process algebra with probabilistic choice operators resolved before alternative and parallel compositions to model distributed computing algorithms such as leader election and consensus.
Information and Computation204(7), 1083–1138 (2006) Probabilistic Imperative Process Algebra 27
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Probabilistic imperative process algebra
Extends imperative process algebra with probabilistic choice operators resolved before alternative and parallel compositions to model distributed computing algorithms such as leader election and consensus.