This paper proposes for the first time an algorithm PSpan for mining frequent complete subnets from a set of Petri nets. We introduced the concept of complete subnets and the net graph representation. PSpan transforms Petri nets in net graphs and performs sub-net graph mining on them, then transforms the results back to frequent subnets. PSpan follows the pattern growth approach and has similar complexity like gSpan in graph mining. Experiments have been done to confirm PSpan's reliability and complexity. Besides C/E nets, it applies also to a set of other Petri net subclasses.

翻译：本文首次提出“PSpan”算法,用于从一套Petri 网中开采经常完整的子网。我们引入了完整的子网和净图示说明的概念。PSpan将Petri 网转换成净额图,并对这些网进行子网图的开采,然后将结果转换回经常的子网。PSpan采用模式增长方法,其复杂性与图形采矿中的gSpan相似。已经进行了实验,以确认PSpan的可靠性和复杂性。除了C/Enet,它也适用于另外一套Petri 网子类。