Control of Petri Nets by Finite Automata
Hans-Dieter Burkhard · Fundamenta Informaticae · 1983
Petri nets are considered where the firings are controlled by finite automata. The control may be distributed to different automata working over disjoint sets of transitions. To avoid deadlocks and conflicts for the whole system the distribution of control must be organized in an appropriate manner. The existence of deadlocks and conflicts is shown to be undecidable in general, but conflict resolving and deadlock free controls can be constructed for given nets.