Supervisory control of Petri nets using routing functions: starvation avoidance issues

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 c...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on cybernetics 2000-10, Vol.30 (5), p.684-695
Main Authors: Alpan, G., Gaujal, B.
Format: Article
Language:English
Subjects:
Algebra
Avoidance
Computational geometry
Cybernetics
Equations
Evolution
Explosions
Mathematical analysis
Mathematical models
Petri nets
Polynomials
Routing
State-space methods
Sufficient conditions
Supervisory control
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 the Petri net under study.
ISSN:1083-4419
2168-2267
1941-0492
2168-2275
DOI:10.1109/3477.875445