By Topic

A colored Petri net-based approach to the design of controllers

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

3 Author(s)
Makungu, M. ; Dept. de Math. et d''Inf., Sherbrooke Univ., Que., Canada ; St-Denis, R. ; Barbeau, M.

In this paper, we extend the supervisory control theory and a supervisor synthesis problem to a class of colored Petri nets. More specifically, we investigate the forbidden state control problem with full observation in which the discrete-event system is modeled as a colored Petri net with a symmetry specification. This problem is decidable if the colored Petri net has finite color sets and bounded places. A new algorithm for deriving a controller is presented in detail with a proof of its correctness. Unlike conventional algorithms that explore the entire reachable set of states, our algorithm avoids an exhaustive search of the state space by exploiting a symmetry specification. It performs particularly well when applied to large but structured processes with similar components. Furthermore, this approach allows to represent a controller in a compact form

Published in:

Decision and Control, 1996., Proceedings of the 35th IEEE Conference on  (Volume:4 )

Date of Conference:

11-13 Dec 1996