By Topic

Supervisor synthesis for bounded Petri nets based on a transformation function

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

4 Author(s)
Yu Ru ; Nat. Lab. of Ind. Control Technol., Zhejiang Univ., Hangzhou, China ; Weimin Wu ; Hongye Su ; Jian Chu

This paper addresses the supervisor synthesis on the forbidden state problem, in which the forbidden markings cannot be easily expressed as linear inequality constraints using reported methods. The system to be controlled is modelled by bounded Petri nets with uncontrollable transitions. Through the analysis of the reverse net, we obtain the weakly forbidden markings in order to deal with uncontrollable transitions. By introducing a transformation function, which facilitates not only tracking the system state but also determining the control pattern, we propose a synthesis method to obtain the maximally permissive supervisor. The method need not analyze the reachability graph and the online computation has the complexity of polynomial times. In addition, for a special class of generalized Petri nets called the input dominant Petri nets, the synthesis method can be applied conveniently, as illustrated by an example in the reported literature.

Published in:

American Control Conference, 2004. Proceedings of the 2004  (Volume:5 )

Date of Conference:

June 30 2004-July 2 2004