S-网的活性分析

Analysis on the Liveness of S-net

讨论了一类结构简单的 Petri网—S-网的活性问题 ,给出了各类 S-网的活性判定定理并给出了判定算法 .算法主要计算工作是变迁的前序库所集和后继变迁集以及极大强连通子网的判断 ,这三个过程实际上是一个树的搜索过程 ,因此算法易于实现 。

Discussed the research on the liveness of S-net, which is a kind of structure-simple Petri net, and obtained a set of judging conditions about it and presented an algorithm to decide the liveness of each transition. The algorithm is efficient and easy to realize because it is based on searching the maximum strong connected sub nets and the preset and post place set of transitions.