Control of elementary and dependent siphons in Petri nets and their application

Document Type

Article

Publication Date

11-3-2008

Abstract

The importance of siphons is well recognized in the analysis and control of deadlocks in a Petri net. To minimize the number of siphons that have to be explicitly controlled, siphons in a net are divided in a net into elementary and dependent ones. The concepts of token-rich, token-poor, and equivalent siphons are newly presented. More general conditions under which a dependent siphon can be always marked are established. The existence of dependent siphons in a Petri net is investigated. An algorithm is developed to find the set of elementary siphons in a net system for deadlock control purposes. The application of the proposed elementary siphon concept to the existing deadlock control policies is discussed. A few different-sized manufacturing examples are used to demonstrate the advantages of elementary siphon-based policies. The significant value of the proposed theory via a particular deadlock control policy is shown. Finally, some interesting and open problems are discussed. © 2007 IEEE.

Identifier

40949124277 (Scopus)

Publication Title

IEEE Transactions on Systems Man and Cybernetics Part A Systems and Humans

External Full Text Location

https://doi.org/10.1109/TSMCA.2007.909548

ISSN

10834427

First Page

133

Last Page

148

Issue

1

Volume

38

Grant

60228004

Fund Ref

State of New Jersey Commission on Science and Technology

This document is currently not available here.

Share

COinS