Omega algebra, demonic refinement algebra and commands
- Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and infinite iteration. We show that these independently introduced kinds of algebras can actually be defined in terms of each other. By defining modal operators on the underlying weak semiring, that result directly gives a demonic refinement algebra of commands. This yields models in which extensionality does not hold. Since in predicate-transformer models extensionality always holds, this means that the axioms of demonic refinement algebra do not characterise predicate-transformer models uniquely. The omega and the demonic refinement algebra of commands both utilise the convergence operator that is analogous to the halting predicate of modal "µ"-calculus. We show that the convergence operator can be defined explicitly in terms of infinite iteration and domain if and only if domain coinduction for infinite iteration holds.
| Author: | Peter HöfnerGND, Kim Solin, Bernhard MöllerGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-2319 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/286 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2006-11) |
| Publisher: | Institut für Informatik, Universität Augsburg |
| Place of publication: | Augsburg |
| Type: | Report |
| Language: | English |
| Year of first Publication: | 2006 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2006/07/25 |
| GND-Keyword: | Algebraische Struktur; Iteration |
| 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 |
