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

Back

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

Journal article

Peer reviewed

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

Dan You, ShouGuang Wang and MengChu Zhou

Information sciences, Vol.409-410, pp.87-100

10/2017

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

Abstract

Deadlock

Discrete event systems (DES)

Petri nets

Polynomial complexity

Problem decomposition

Siphon computation

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.

Metrics

1 Record Views

Details

Title: Computation of strict minimal siphons in a class of Petri nets based on problem decomposition
Creators - without role: Dan You - Zhejiang Gongshang University
ShouGuang Wang - Zhejiang Gongshang University
MengChu Zhou - New Jersey Institute of Technology
Publication Details: Information sciences, Vol.409-410, pp.87-100
Publisher: Elsevier Inc
Identifiers: 9935962808331
Academic Unit: King Abdulaziz University
Language: English
Resource Type: Journal article