T-网的活性分析及其判断算法

Decision Algorithm for the Liveness of T-Nets

Petri网的活性反映了实际系统的无死锁性.本文讨论了一类结构简单的Petri网—T-网的活性问题,给出了各类T-网的活性判定定理并给出了判定算法.算法主要计算工作是变迁的前序库所集和后继变迁集以及回路的判断,这三个过程实际上是一个树的搜索过程,因此算法易于实现,判定效率也大大提高.

The liveness is an important property for Petri net, and it is difficult to decide whether a Petri net is live or not. In this paper, we have a research on the liveness of T-net, which is a kind of structure-simple Petri net. A set of decision conditions about the liveness of T-net and the algorithm to judge the liveness of each transition are presented. 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. The decision of the liveness of the structure-complex Petri nets will benefit the results obtained based on the decomposition methods for Petri net.