TY  - JOUR
A1  - Möller, Bernhard
T1  - Lazy Kleene Algebra
T2  - Lecture Notes in Computer Science
N2  - 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 the predicate transformers form lazy Kleene algebras again, the disjunctive and conjunctive ones even lazy Kleene algebras with an omega operation.
Y1  - 2004
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/35962
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-359624
SN  - 0302-9743
VL  - 3125
SP  - 252
EP  - 273
PB  - Springer
ER  -