Connections between a concrete and an abstract model of concurrent systems
EW Stark - International Conference on Mathematical Foundations …, 1989 - Springer
We define a concrete operational model of concurrent systems, called trace automata. For
such automata, there is a natural notion of permutation equivalence of computation …
such automata, there is a natural notion of permutation equivalence of computation …
Concurrency, automata and domains
M Droste - International Colloquium on Automata, Languages …, 1990 - Springer
We introduce an operational model of concurrent systems, called concurrent automata.
These are labeled transition systems A in which the event set is endowed with a collection of …
These are labeled transition systems A in which the event set is endowed with a collection of …
Concurrent automata and domains
M Droste - International Journal of Foundations of Computer …, 1992 - World Scientific
We introduce an operational model of concurrent systems, called automata with concurrency
relations. These are labeled transition systems in which the event set is endowed with a …
relations. These are labeled transition systems in which the event set is endowed with a …
From domains to automata with concurrency
F Bracho, M Droste - International Colloquium on Automata, Languages …, 1993 - Springer
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 …
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 …
Representation of computations in concurrent automata by dependence orders
F Bracho, M Droste, D Kuske - Theoretical Computer Science, 1997 - Elsevier
An automaton with concurrency relations A is a labelled transition system with a collection of
binary relations indicating when two actions in a given state of the automaton can occur …
binary relations indicating when two actions in a given state of the automaton can occur …
Concurrent transition systems
EW Stark - Theoretical Computer Science, 1989 - Elsevier
Concurrent transition systems (CTS's), are ordinary nondeterministic transition systems that
have been equipped with additional concurrency information. This concurrency information …
have been equipped with additional concurrency information. This concurrency information …
Synthesis of nondeterministic asynchronous automata
G Pighizzini - Semantics of programming languages and model …, 1993 - books.google.com
In this paper we state a new characterization of the class of recognizable trace languages
[Maz77]: we prove that this class coincides with the minimal class of trace languages …
[Maz77]: we prove that this class coincides with the minimal class of trace languages …
Rational and recognizable complex trace languages
Mazurkiewicz defined traces as an algebraic model of finite concurrent processes. In order
to model non-terminating processes a good notion of infinite traces was needed, which …
to model non-terminating processes a good notion of infinite traces was needed, which …
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 …