Characterizing determinacy in Kleene algebras

  • 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.

Download full text files

Export metadata


Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Author:Jules DesharnaisGND, Bernhard MöllerGND
Frontdoor URL
Parent Title (English):Information Sciences
Publisher:Elsevier BV
Year of first Publication:2001
Publishing Institution:Universität Augsburg
Release Date:2019/05/21
Tag:Control and Systems Engineering; Theoretical Computer Science; Software; Information Systems and Management; Artificial Intelligence; Computer Science Applications
First Page:253
Last Page:273
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
Licence (German):CC-BY-NC-ND 4.0: Creative Commons: Namensnennung - Nicht kommerziell - Keine Bearbeitung (mit Print on Demand)