TY  - JOUR
A1  - Möller, Bernhard
T1  - Kleene getting lazy
T2  - Science of Computer Programming
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. We show that predicate transformers form lazy Kleene algebras, the disjunctive and conjunctive ones even lazy omega Kleene algebras. We also briefly sketch two further applications: a modal lazy Kleene algebra of commands modelling total correctness and another one that abstractly characterizes sets of trajectories as used in the description of reactive and hybrid systems.
Y1  - 2007
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/39117
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-391171
SN  - 0167-6423
VL  - 65
IS  - 2
SP  - 195
EP  - 214
PB  - Elsevier BV
ER  -