Skip to Main content Skip to Navigation
Journal articles

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

Gülgün Alpan 1 Bruno Gaujal 2
1 MACSI - Industrial system modeling, analysis and operation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/inria-00099110
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:51:04 AM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM

Identifiers

  • HAL Id : inria-00099110, version 1

Collections

Citation

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, Institute of Electrical and Electronics Engineers, 2000, 30 (5), pp.684-695. ⟨inria-00099110⟩

Share

Metrics

Record views

174