Control of Petri Nets by Finite Automata

Article type: Research Article

Authors: Burkhard, Hans-Dieter

Affiliations: [a] Humboldt University of Berlin

Abstract: 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.

Keywords: Petri nets, automata, control of concurrent systems, conflict, deadlock

DOI: 10.3233/FI-1983-6204

Journal: Fundamenta Informaticae, vol. 6, no. 2, pp. 185-215, 1983