By Topic

Non-blocking supervisors synthesis for a class of generalized Petri nets based on proper resource allocation

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)
Mi Zhao ; Coll. of Machinery & Electr., Shihezi Univ., Shihezi, China ; Yifan Hou

This work presents a deadlock prevention policy in polynomial complexity for a class of generalized Petri nets, namely G-systems, which allows multiple resource acquisitions and flexible routings with assembly and disassembly operations. The proposed method aims to properly adjust resource allocation requirements of the various requesting processes in terms of different resource partial orders. Consequently, the supervised system has no deadlock state by imposing on the operation places a set of linear inequality controllability constraints that are implemented by monitors. Moreover, a structurally simple liveness-enforcing net supervisor can be obtained after the redundant constraints are removed. The proposed method can usually lead to a suboptimal supervisor with high computational efficiency than the existing methods. Finally, an application of this method to a G-system is presented.

Published in:

Mechatronics and Automation (ICMA), 2012 International Conference on

Date of Conference:

5-8 Aug. 2012