TY  - RPRT
A1  - Möller, Bernhard
A1  - Struth, Georg
T1  - Greedy-like algorithms in Kleene algebra
N2  - This paper provides an algebraic background for the formal derivation of greedy-like algorithms. Such derivations have previously been done in various frameworks including relation algebra. We propose Kleene algebra as a particularly simple alternative. Instead of converse and residuation we use modal operators that are definable in a wide class of algebras, based on domain/codomain or image/pre-image operations. By abstracting from earlier approaches we arrive at a very general theorem about the correctness of loops that covers particular forms of greedy algorithms as special cases.
T3  - Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg - 2003-11 
KW  - Kleene-Algebra
KW  - Greedy-Algorithms
KW  - Idempotent semiring
KW  - Kleene algebra
KW  - image and preimage operation
KW  - modal operators
KW  - confluence
KW  - Geach formula
KW  - program development and analysis
Y1  - 2006
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/254
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-2051
PB  - Institut für Informatik, Universität Augsburg
CY  - Augsburg
ER  -