2006 | OriginalPaper | Chapter
Weak Kleene Algebra and Computation Trees
Author : Ernie Cohen
Published in: Relations and Kleene Algebra in Computer Science
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The Kleene algebra axioms are too strong for some program models of interest (e.g. models that mix demonic choice with angelic or probabilistic choice). This has led to proposals that weaken the right distributivity axiom to monotonicity, and possibly weaken or eliminate the right induction and left annihilation axioms (e.g. lazy Kleene algebra, probabilistic Kleene algebra, monodic tree Kleene algebra, etc.). We’ll address some of the basic metatheoretic properties of these theories using rational trees modulo simulation equivalence.