Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Weak Kleene Algebra and Computation Trees
verfasst von : Ernie Cohen
Erschienen in: Relations and Kleene Algebra in Computer Science
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.