By Topic

Comment on "On Siphon Computation for Deadlock Control in 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
$33 $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)
Huixia Liu ; Key Lab. for Manuf. Syst. Eng., Xi'an Jiaotong Univ., Xian, China ; Keyi Xing ; Song Gao

It was claimed recently in the paper by Li and Zhou that ldquoa polynomial time algorithm for finding the set of elementary siphons in S3PRs is proposed, which avoids complete siphon enumerationrdquo. However, this is incorrect because Proposition 1 and Corollary 6 of the aforementioned paper, which lead to the claim, are both incorrect. In this correspondence paper, Proposition 1 and Corollary 6 are disproved. As a consequence, some claims of the aforesaid paper are denied. Two examples are presented to disprove some claims of the previously mentioned paper.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans  (Volume:39 ,  Issue: 6 )