Abstract
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of composition. This allows the subsumption of Dijkstra's computation calculus, Cohen's omega algebra and von Wright's demonic refinement algebra. Moreover, by adding domain and codomain operators we can also incorporate modal operators. Finally, it is shown that predicate transformers form lazy Kleene algebras again, the disjunctive and conjunctive ones even lazy Kleene algebras with an omega operation. © Springer-Verlag 2004.
Cite
CITATION STYLE
Möller, B. (2004). Lazy Kleene algebra. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3125, 252–273. https://doi.org/10.1007/978-3-540-27764-4_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
