Lazy Kleene Algebra

  • 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.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Bernhard MöllerGND
URN:urn:nbn:de:bvb:384-opus4-359624
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/35962
ISSN:0302-9743OPAC
Parent Title (English):Lecture Notes in Computer Science
Publisher:Springer
Type:Article
Language:English
Year of first Publication:2004
Publishing Institution:Universität Augsburg
Release Date:2017/07/21
Volume:3125
First Page:252
Last Page:273
DOI:https://doi.org/10.1007/978-3-540-27764-4_14
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):Deutsches Urheberrecht