On probabilistic Kleene algebras, automata and simulations

Annabelle McIver*, Tahiry M. Rabehaja, Georg Struth

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationRelational and Algebraic Methods in Computer Science
Subtitle of host publication12th International Conference, RAMICS 2011, Rotterdam, The Netherlands, May 30 – June 3, 2011. Proceedings
EditorsHarrie de Swart
Place of PublicationHeidelberg
PublisherSpringer, Springer Nature
Pages264-279
Number of pages16
ISBN (Electronic)9783642210709
ISBN (Print)9783642210693
DOIs
Publication statusPublished - 2011
Event12th International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011 - Rotterdam, Netherlands
Duration: 30 May 20113 Jun 2011

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume6663
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011
Country/TerritoryNetherlands
CityRotterdam
Period30/05/113/06/11

Fingerprint

Dive into the research topics of 'On probabilistic Kleene algebras, automata and simulations'. Together they form a unique fingerprint.

Cite this