An effective algorithm to find elementary siphons in a class of petri nets

Authors

An Rong Wang, Xidian University
Zhi Wu Li, Xidian University
Jian Yuan Jia, Xidian University
Meng Chu Zhou, Xidian University

Document Type

Article

Publication Date

7-23-2009

Abstract

As a structural object of Petri nets, siphons play a key role in the development of deadlock prevention policies for resource allocation systems. Elementary siphons are a novel concept in net theory. Based on graph theory, this paper proposes an effective algorithm with polynomial complexity to find a set of elementary siphons for a linear system of simple sequential processes with resources (LS³PR), a subclass of Petri nets, which can model many flexible manufacturing systems. The algorithm is established through the use of a resource directed graph and complementary sets of strict minimal siphons (SMS) of the net. The upper bound of the number of SMS in such a net is identified. A running example is used to demonstrate the proposed method. © 2009 IEEE.

Identifier

67650690609 (Scopus)

Publication Title

IEEE Transactions on Systems Man and Cybernetics Part A Systems and Humans

External Full Text Location

https://doi.org/10.1109/TSMCA.2009.2019880

ISSN

10834427

First Page

912

Last Page

923

Issue

4

Volume

39

Grant

20070701013

Fund Ref

Ministry of Science and Technology

Recommended Citation

Wang, An Rong; Li, Zhi Wu; Jia, Jian Yuan; and Zhou, Meng Chu, "An effective algorithm to find elementary siphons in a class of petri nets" (2009). Faculty Publications. 12022.
https://digitalcommons.njit.edu/fac_pubs/12022