Characterizing determinacy in Kleene algebras
- Elements of Kleene algebras can be used, among others, as abstractions of the input-output semantics of nondeterministic programs or as models for the association of pointers with their target objects. In the first case, one seeks to distinguish the subclass of elements that correspond to deterministic programs. In the second case one is only interested in functional correspondences, since it does not make sense for a pointer to point to two different objects. We discuss several candidate notions of determinacy and clarify their relationship. Some characterizations that are equivalent in the case where the underlying Kleene algebra is an (abstract) relation algebra are not equivalent for general Kleene algebras.
| Author: | Jules DesharnaisGND, Bernhard MöllerGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-2104 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/259 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2000-05) |
| Publisher: | Institut für Informatik, Universität Augsburg |
| Place of publication: | Augsburg |
| Type: | Report |
| Language: | English |
| Year of first Publication: | 2000 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2006/06/20 |
| 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 |
