On probabilistic kleene algebras, automata and simulations

Authors:
Annabelle McIver;Tahiry M. Rabehaja;Georg Struth
Affiliations:
Department of Computing, Macquarie University, Australia;Department of Computer Science, The University of Sheffield, UK;Department of Computer Science, The University of Sheffield, UK
Venue:
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Year:
2011

Citing 18
Cited 0

On Kleene algebras and closed semirings

MFCS '90 Proceedings on Mathematical foundations of computer science 1990
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Handbook of Process Algebra

Handbook of Process Algebra
Simulation-based minimization

ACM Transactions on Computational Logic (TOCL)
Automata and Coinduction (An Exercise in Coalgebra)

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Linear Time-Branching Time Spectrum (Extended Abstract)

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
An algebraic definition of simulation between programs

An algebraic definition of simulation between programs
Towards a refinement algebra

Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)

Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Concurrent Kleene Algebra

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A non-probabilistic relational model of probabilistic Kleene algebras

RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Relational and multirelational representation theorems for complete idempotent left semirings

RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Towards automated proof support for probabilistic distributed systems

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Using probabilistic kleene algebra for protocol verification

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Monodic tree kleene algebra

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
An efficient coq tactic for deciding kleene algebras

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Proof Pearl: Regular Expression Equivalence and Relation Algebra

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a class of automata modulo simulation equivalence forms a model of probabilistic Kleene algebra. We prove completeness of this model with respect to continuous probabilistic Kleene algebras. Hence an identity is valid in continuous probabilistic Kleene algebras if and only if the associated automata are simulation equivalent.