Abstract:

It is important for using a quick way to get the logical structure of traps (siphons) in large complex Petri net models. Therefore, an efficient fast algorithm based on the incidence matrix is presented. After analyzing the characters of trap (siphon) structures in the incidence matrix of Petri nets, a binary operation operator following the rules of composing each input and output place pair is proposed. And then, the incidence matrix algorithm of computing the minimum trap (siphon) sets is brought forward. The algorithm is used to compute the minimum trapssiphon set for one example, and for comparison, it is exemplified that the matrix  algorithm is much efficient, particularly for large scale Petri net models.