2000 character limit reached
Weak Concurrent Kleene Algebra with Application to Algebraic Verification (1301.7153v1)
Published 30 Jan 2013 in cs.FL
Abstract: We propose a generalisation of concurrent Kleene algebra \cite{Hoa09} that can take account of probabilistic effects in the presence of concurrency. The algebra is proved sound with respect to a model of automata modulo a variant of rooted $\eta$-simulation equivalence. Applicability is demonstrated by algebraic treatments of two examples: algebraic may testing and Rabin's solution to the choice coordination problem.