By Topic

A Method to Compute Strict Minimal Siphons in a Class of Petri Nets Based on Loop Resource Subsets

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)
ShouGuang Wang ; Coll. of Inf. & Electron. Eng., Zhejiang Gongshang Univ., Hangzhou, China ; ChengYing Wang ; Zhou, M. ; Li, Z.

Strict minimal siphons (SMS) play an important role in the development of deadlock control policies for flexible manufacturing systems (FMS). For a class of Petri nets called Systems of Simple Sequential Processes with Resources (S3PR), the resource circuit-based method is an effective way to compute SMS. In this paper, a more effective one to compute SMS is proposed. First, the concepts of loop resource subsets and their characteristic resource subnets are proposed. Next, sufficient and necessary conditions for loop resource subsets to generate SMS are established. Finally, an algorithm is given to find all the SMS based on loop resource subsets. Since the number of loop resource subsets is much less than that of resource circuits and their combinations, the computational efficiency of the SMS enumeration task is significantly improved by the proposed method. An FMS example is used to illustrate the application of the proposed method, and computational time comparisons are provided on several S3PRs to show its superior efficiency.

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:42 ,  Issue: 1 )