Supervisory Control of Petri Nets using routing function: Starvation avoidance issues - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics Année : 2000

Supervisory Control of Petri Nets using routing function: Starvation avoidance issues

Bruno Gaujal

Résumé

In this paper, we present a new point of view on supervisory control of Petri nets by using routing functions instead of the traditional control places. We first show the relation between the two notions. In the second part of the paper we illustrate 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, we use algebraic polynomial geometry in the continuous case and Diophantine equations for the discrete version of Petri nets under study.
Fichier non déposé

Dates et versions

inria-00099110 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00099110 , version 1

Citer

Gülgün Alpan, Bruno Gaujal. Supervisory Control of Petri Nets using routing function: Starvation avoidance issues. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 2000, 30 (5), pp.684-695. ⟨inria-00099110⟩
56 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More