Extends pomsetc and step automata with communication operators and establishes algebras modulo language equivalence and truly concurrent bisimilarities.
Probabilistic Concurrent Kleene Algebra
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
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.
fields
cs.LO 2representative citing papers
citing papers explorer
-
Computation and Concurrency
Extends pomsetc and step automata with communication operators and establishes algebras modulo language equivalence and truly concurrent bisimilarities.
- Finitary Truly Concurrent Bisimulations