pith. sign in

arxiv: 1306.2697 · v1 · pith:BUMU653Rnew · submitted 2013-06-12 · 💻 cs.LO

Probabilistic Concurrent Kleene Algebra

classification 💻 cs.LO
keywords probabilisticalgebraconcurrentkleeneaccountalgebraicalgebrasautomata
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Finitary Truly Concurrent Bisimulations

    cs.LO 2026-05 unverdicted novelty 4.0

    Defines finitary versions of truly concurrent prebisimulations following the behavioural form to enable full abstraction in denotational semantics of concurrent processes.

  2. Computation and Concurrency

    cs.LO 2024-09 unverdicted novelty 4.0

    Extends pomsetc and step automata with communication operators and establishes algebras modulo language equivalence and truly concurrent bisimilarities.