On siphon computation for deadlock control in a class of Petri nets

Document Type

Article

Publication Date

5-1-2008

Abstract

As a structural object, siphons are well recognized in the analysis and control of deadlocks in resource allocation systems modeled with Petri nets. Many deadlock prevention policies characterize the deadlock behavior of the systems in terms of siphons and utilize this characterization to avoid deadlocks. This paper develops a novel methodology to find interesting siphons for deadlock control purposes in a class of Petri nets, i.e., a system of simple sequential processes with resources (S3 PR). Resource circuits in an (S3 PR) are first detected, from which, in general, a small portion of emptiable minimal siphons can be derived. The remaining emptiable ones can be found by their composition. A polynomial-time algorithm for finding the set of elementary siphons is proposed, which avoids complete siphon enumeration. It is shown that a dependent siphon can always be controlled by properly supervising its elementary siphons. A computationally efficient deadlock control policy is accordingly developed. Experimental study shows the efficiency of the proposed siphon computation approach. © 2008 IEEE.

Identifier

43249102181 (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.2008.918605

ISSN

10834427

First Page

667

Last Page

679

Issue

3

Volume

38

Grant

20070701013

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS