Computation of all minimal siphons in Petri nets

Document Type

Conference Proceeding

Publication Date

7-4-2012

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. © 2012 IEEE.

Identifier

84863112138 (Scopus)

ISBN

[9781467303880]

Publication Title

Proceedings of 2012 9th IEEE International Conference on Networking Sensing and Control Icnsc 2012

External Full Text Location

https://doi.org/10.1109/ICNSC.2012.6204889

First Page

46

Last Page

51

This document is currently not available here.

Share

COinS