In: IEEE Trans. on Systems, Man, and Cybernetics; B: Cybernetics, Vol. 30, No. 5, pages 684-695. 2000.
Abstract: This paper presents a new point of view on supervisory control of Petri nets by using routing functions instead of the traditional control places. The relation between the two notions is discussed. Then the paper illustrates the use of routing functions by showing how to compute a routing function in order to avoid starvation in general Petri nets. This control uses a continuous version of the net and a description of the evolution of the net under the form of linear algebraic equations. As for the computational part, algebraic polynomial geometry in the continuous case and Diophantine equations for the discrete version of the Petri net under study are used.
Keywords: Petri nets, control places, routing functions, starvation avoidance, supervisory control.