TY  - RPRT
A1  - Desharnais, Jules
A1  - Möller, Bernhard
T1  - Characterizing determinacy in Kleene algebras (revised version)
N2  - 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.
T3  - Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg - 2001-03 
KW  - Kleene-Algebra
KW  - Determiniertheit <Informatik>
KW  - semantics
KW  - determinacy
KW  - Kleene algebra
KW  - relational algebra
Y1  - 2006
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/258
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-2093
PB  - Institut für Informatik, Universität Augsburg
CY  - Augsburg
ER  -