By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Alpan, G. ; INRIA, Nancy, France ; Gaujal, B.

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

Published in:

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on  (Volume:30 ,  Issue: 5 )