By Topic

Approach for Transforming Linear Constraints on Petri Nets

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
$33 $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)
Jiliang Luo ; Department of Control Science and Engineering, Huaqiao University, Xiamen, China ; Kenzo Nonami

An efficient supervisor synthesis method is proposed based on the constraint transformation, since enforcing a logic expression of linear constraints on Petri nets essentially involves finding admissible constraints. It consists of cooperative algorithms that are used to obtain the logic expression of constraints for any set of forbidden markings, to remove redundant constraints using the quantity information of constraints, to judge the existence of a permissive supervisor, to equivalently reduce multiple constraints into a single one using net structural properties, and to approach the admissible constraints from the original ones for ordinary Petri nets. These algorithms are derived from a series of theorems and lemmas presented to construct the theory of constraint transformation or reduction. In addition, the linear constraint, whose uncontrollable subnet is a forward-concurrent free net, can be equivalently transformed into an admissible linear constraint using this method.

Published in:

IEEE Transactions on Automatic Control  (Volume:56 ,  Issue: 12 )