By Topic

A fast algorithm to find a set of elementary siphons for a class of 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)
Xiangling Liu ; Sch. of Electro-Mech. Eng., Xidian Univ., Xi''an ; Anrong Wang ; Li, Z.

Elementary siphons are a special class of the strict minimal siphons (SMS), which play an important role in the deadlock prevention of Petri nets. The existing computation methods in the literature depend on the complete siphon enumeration of a net. Since the number of minimal siphons grows in general exponentially with respect to the size of a net, it is difficult to compute all the SMS. This paper proposes a fast algorithm to find a set of elementary siphons for an L-S3PR based on partial SMS from a structural perspective. We show an approach to obtain a minimal siphon from a resource circuit. The concepts of the complementary matrix and independent arcs in a resource directed graph are proposed, which are important in our method. We describe the method of computing independent arcs in details. Then an algorithm to find a set of elementary siphons for an L-S3PR is developed. Compared with the existing methods, our method is much efficient

Published in:

Automation Science and Engineering, 2006. CASE '06. IEEE International Conference on

Date of Conference:

8-10 Oct. 2006