Nondeterministic automata with concurrency relations and domains
D Kuske - Colloquium on Trees in Algebra and Programming, 1994 - Springer
We introduce an operational model of concurrent systems, called nondeterministic automata
with concurrency relations. These are nondeterministic labelled transition systems where the …
with concurrency relations. These are nondeterministic labelled transition systems where the …
Labelled domains and automata with concurrency
F Bracho, M Droste - Theoretical computer science, 1994 - Elsevier
We investigate an operational model of concurrent systems, called automata with
concurrency relations. These are labelled transition systems A in which the event set is …
concurrency relations. These are labelled transition systems A in which the event set is …
A Kleene theorem for recognizable languages over concurrency monoids
M Droste - International Colloquium on Automata, Languages …, 1994 - Springer
Abstract Automata with concurrency relations A are labelled transition systems with a
collection of binary relations indicating when two events, in a given state of the automaton …
collection of binary relations indicating when two events, in a given state of the automaton …