Computation of all minimal siphons in Petri nets

S. G. Wang, Y. Li, C. Y. Wang, M. C. Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

Efficient extraction of minimal siphons is fundamentally important in deadlock control. So far, methods that are based on problem reduction and decomposition are recognized as effective ways. In this paper, an improved method is proposed to identify all minimal siphons. New conditions are proposed under which a problem needs not be decomposed. It significantly simplifies the process of problem decomposition in the existing methods, thereby reducing the memory and improving the computational efficiency. An example is used to illustrate the application of the proposed method.

Original languageEnglish (US)
Title of host publicationProceedings of 2012 9th IEEE International Conference on Networking, Sensing and Control, ICNSC 2012
Pages46-51
Number of pages6
DOIs
StatePublished - Jul 4 2012
Event2012 9th IEEE International Conference on Networking, Sensing and Control, ICNSC 2012 - Beijing, China
Duration: Apr 11 2012Apr 14 2012

Publication series

NameProceedings of 2012 9th IEEE International Conference on Networking, Sensing and Control, ICNSC 2012

Other

Other2012 9th IEEE International Conference on Networking, Sensing and Control, ICNSC 2012
CountryChina
CityBeijing
Period4/11/124/14/12

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Keywords

  • Petri nets
  • siphon
  • tree

Fingerprint Dive into the research topics of 'Computation of all minimal siphons in Petri nets'. Together they form a unique fingerprint.

Cite this