Probabilistic Concurrent Kleene Algebra
read the original abstract
We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of probabilistic automata modulo probabilistic simulation. We use the resulting algebra to generalise the algebraic formulation of a variant of Jones' rely/guarantee calculus.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Finitary Truly Concurrent Bisimulations
Defines finitary versions of truly concurrent prebisimulations following the behavioural form to enable full abstraction in denotational semantics of concurrent processes.
-
Computation and Concurrency
Extends pomsetc and step automata with communication operators and establishes algebras modulo language equivalence and truly concurrent bisimilarities.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.