大型Petri网模型最小trap (siphon)集合的快速求解算法

为了快速确定大型Petri网模型中的trap (siphon) 逻辑结构，提出一种由Petri网关联矩阵寻找最小trap和siphon集合的有效算法。通过分析Petri网中trap和siphon集合对应的库所子集在关联矩阵中的特征，根据变迁的输入输出库所组合规则和目的，提出一种二元操作算子，由此构造计算最小trap和siphon集合的矩阵求解算法，以实例详细阐述了算法的具体步骤。通过与已有求解方法的比较，进一步验证了该算法在求解大型Petri网系统最小trap（siphon）集合上的计算速度优势。

Efficient algorithm for computing minimum trap (siphon) set in large scale Petri net models

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.