Petri网的同步距离计算

An Algorithm of Computing Synchronic Distance in Petri Nets

同步距离是刻画事件之间同步关系的一个重要的定量分析手段。本文提出了同步距离计算网SDCNet的概念模型并讨论了计算同步距离的几个结论,给出了S_元中初始标识的配置算法以及以此为基础计算同步距离的算法。分析表明该算法与可覆盖性树的生成算法具有相同的复杂性。

The synchronic distance is an important analyzing metric to describe the synchronic relationship between two events. The concept model SDCNet （synchronic distance computing net） is presented and some conclusions of computing synchronic distance are discussed. The algorithm of setting initial markings in S-elements is given and that of computing synchronic distance basing on the first algorithm is also presented. The analysis shows that the algorithms have the same complexity as that of constructing coverability tree.