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

Dan You,Shouguang Wang,Mengchu Zhou

doi:10.1016/j.ins.2017.05.011

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

Dan You, Shouguang Wang + Show 1 more

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

Copy DOI

Journal: Information Sciences	Publication Date: May 8, 2017
Citations: 18

Affiliation: Zhejiang Gongshang University, New Jersey Institute of Technology

#Systems Of Simple Sequential Processes #Strict Minimal Siphons + Show 8 more

Abstract
Full-Text PDF
Similar Papers

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 (S3PR). It is proved to be of polynomial complexity with respect to the number of SMSs. Therefore, it is readily applicable to an S3PR with a large number of SMSs. Its superiority over the existing methods is validated via experimental results.

Full Text