Computation of strict minimal siphons in a class of Petri nets based on problem decomposition

Authors

Dan You, Zhejiang Gongshang University
Shou Guang Wang, Zhejiang Gongshang University
Meng Chu Zhou, Newark College of Engineering

Document Type

Article

Publication Date

10-1-2017

Abstract

Efficient siphon computation plays an important role in deadlock control. This work, based on problem decomposition, develops a new method to compute all strict minimal siphons (SMS) in a class of Petri nets called Systems of Simple Sequential Processes with Resources (S³PR). It is proved to be of polynomial complexity with respect to the number of SMSs. Therefore, it is readily applicable to an S³PR with a large number of SMSs. Its superiority over the existing methods is validated via experimental results.

Identifier

85019179059 (Scopus)

Publication Title

Information Sciences

External Full Text Location

https://doi.org/10.1016/j.ins.2017.05.011

ISSN

00200255

First Page

87

Last Page

100

Volume

409-410

Grant

61472361

Fund Ref

Zhejiang Gongshang University

Recommended Citation

You, Dan; Wang, Shou Guang; and Zhou, Meng Chu, "Computation of strict minimal siphons in a class of Petri nets based on problem decomposition" (2017). Faculty Publications. 9278.
https://digitalcommons.njit.edu/fac_pubs/9278