Termination in modal Kleene algebra
- Modal Kleene algebras are Kleene algebras with forward and backward modal operators defined via domain and codomain operations. The paper investigates the algebraic structure of modal operators. It studies and compares different notions of termination in this class, including an algebraic correspondence proof of Löb's formula from modal logic. It gives calculational proofs of two fundamental statements from rewriting theory that involve termination: Bachmair's and Dershowitz's well-founded union theorem and Newman's lemma. These results are also of general interest for the termination analysis of programs and state transition systems.
| Author: | Jules DesharnaisGND, Bernhard MöllerGND, Georg StruthGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-2038 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/252 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2004-04) |
| Publisher: | Institut für Informatik, Universität Augsburg |
| Place of publication: | Augsburg |
| Type: | Report |
| Language: | English |
| Year of first Publication: | 2004 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2006/06/19 |
| GND-Keyword: | Kleene-Algebra |
| 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 |
