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

Dan You, Shou Guang Wang, Meng Chu Zhou

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)87-100
Number of pages14
JournalInformation sciences
Volume409-410
DOIs
StatePublished - Oct 1 2017

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Keywords

  • Deadlock
  • Discrete event systems (DES)
  • Petri nets
  • Polynomial complexity
  • Problem decomposition
  • Siphon computation

Fingerprint Dive into the research topics of 'Computation of strict minimal siphons in a class of Petri nets based on problem decomposition'. Together they form a unique fingerprint.

Cite this