Some results and open problems concerning elementary siphons of Petri nets

Author

Li, ZhiWu ; Zhou, MengChu

Author_Institution

Sch. of Electro-Mech. Eng., Xidian Univ., Xi´´an, China

Volume

2

fYear

2004

fDate

10-13 Oct. 2004

Firstpage

1717

Abstract

Siphons are related to the liveness property of Petri net models of concurrent systems. Elementary siphons, an important concept proposed in our previous work, has been proved to be an effective way to characterize, analyze, and control deadlocks in these systems. This paper first surveys the existing results on elementary siphons of Petri nets. It is proved that the number of elementary siphons in a Petri net is bounded by the smaller of place count and transition count. We investigate the conditions under which there is no weakly dependent siphon in a Petri net. A polynomial algorithm is developed to decide the set of elementary siphons for the deadlock control purpose. Some interesting and open problems on elementary siphons are finally discussed.

Keywords

Petri nets; polynomials; resource allocation; Petri nets; concurrent system; deadlock control; elementary siphons; polynomial algorithm; resource allocation system; Computer displays; Control system analysis; Control systems; Controllability; Mathematical model; Petri nets; Polynomials; Resource management; System recovery;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man and Cybernetics, 2004 IEEE International Conference on

ISSN

1062-922X

Print_ISBN

0-7803-8566-7

Type

conf

DOI

10.1109/ICSMC.2004.1399881

Filename

1399881