Theory of regions
E Badouel, P Darondeau - Advanced Course on Petri Nets, 1996 - Springer
The synthesis problem for nets consists in deciding whether a given graph is isomorphic to
the marking graph of some net and then constructing it. This problem has been solved in the …
the marking graph of some net and then constructing it. This problem has been solved in the …
Aperiodic languages in concurrency monoids
M Droste - information and computation, 1996 - Elsevier
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, are …
binary relations indicating when two events, in a given state of the automaton, are …