TY  - JOUR
A1  - Desharnais, Jules
A1  - Möller, Bernhard
T1  - Characterizing determinacy in Kleene algebras
T2  - Information Sciences
N2  - Elements of Kleene algebras can be used, among other ways, as abstractions of the input-output semantics of nondeterministic programs or as models for the association of pointers with their target objects. One is interested in a notion of determinacy, in the first case, to distinguish deterministic programs and, in the second case, 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 when the underlying Kleene algebra is an (abstract) relation algebra are not equivalent for general Kleene algebras.
KW  - Control and Systems Engineering
KW  - Theoretical Computer Science
KW  - Software
KW  - Information Systems and Management
KW  - Artificial Intelligence
KW  - Computer Science Applications
Y1  - 2001
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/54193
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-541931
SN  - 0020-0255
VL  - 139
IS  - 3-4
SP  - 253
EP  - 273
PB  - Elsevier BV
ER  -