Comment on "On Siphon Computation for Deadlock Control in a Class of Petri Nets

It was claimed recently in the paper by Li and Zhou that ldquoa polynomial time algorithm for finding the set of elementary siphons in S 3 PRs is proposed, which avoids complete siphon enumerationrdquo. However, this is incorrect because Proposition 1 and Corollary 6 of the aforementioned paper, whi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on systems, man and cybernetics. Part A, Systems and humans man and cybernetics. Part A, Systems and humans, 2009-11, Vol.39 (6), p.1348-1350
Hauptverfasser: Huixia Liu, Huixia Liu, Keyi Xing, Keyi Xing, Song Gao, Song Gao
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:It was claimed recently in the paper by Li and Zhou that ldquoa polynomial time algorithm for finding the set of elementary siphons in S 3 PRs 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.
ISSN:1083-4427
2168-2216
1558-2426
2168-2232
DOI:10.1109/TSMCA.2009.2030162