Research on finding elementary siphon in a class of petri nets

Abstract

This paper develops an algorithm to find a set of elementary siphons for a linear simple sequential process with resources. A graph-based technique is used to achieve elementary resource transition circuits (RTCs) initially. Then, some maximal perfect resource-transition circuits (MPCs) can be derived from elementary RTCs. Next, MPCs are used to developed T-characteristic vectors according to their correspondence relation. Finally, the set of elementary siphons can be established through computing a maximal set of linear indepen- dent rows of the characteristic T-vector matrix using the Gauss elimination. An example is included to validate the effectiveness of the proposed method. © 2012 Springer-Verlag Berlin Heidelberg.