Chapter
On Concurrent Program Algebra and Demonic Automata
Abstract
Regular expressions describe languages accepted by finite state automata with angelic nondeterminism. Regular expressions obey the axioms of Kleene algebra. We consider automata with demonic nondeterminism, using a different criterion for acceptance. The demonic nondeterminism corresponds to that of predicate transformers; it allows nondeterministic sequential and concurrent programs to be modelled. The corresponding regular expressions obey …
Authors
Sekerinski E
Book title
Theoretical Aspects of Computing – ICTAC 2024
Series
Lecture Notes in Computer Science
Volume
15373
Pagination
pp. 114-131
Publisher
Springer Nature
Publication Date
2025
DOI
10.1007/978-3-031-77019-7_7