Close category search window
 

Supervisory control of discrete event systems using enabling arc 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
$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)
Weimin Wu ; Nat. Lab. of Ind. Control Technol., Zhejiang Univ., Hangzhou, China ; Hongye Su ; Jian Chu

This paper addresses the supervisory control of the class of discrete event system (DES) modeled by a Petri net. The control specification described by a linear 'less-than-or-equal-to' inequality defined on the place marking of the net has been extensively studied in the literatures. However, in this paper we consider the control specification in the form of linear 'greater-than-or-equal-to' marking inequality. The supervisory control of the DES with 'greater-than-or-equal-to' constraint is implemented via an enabling arc, which is a recently proposed arc by Uzam (1998) and Uzam et al. (1999) and can be regarded as complementarity of inhibitor arc. An example illustrates the supervisory control method is presented in this paper.

Published in:
Robotics and Automation, 2002. Proceedings. ICRA '02. IEEE International Conference on  (Volume:2 )

Date of Conference: 2002

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.