关于Petri网归约问题

Petri 同归约问题是当今 petri 网研究领域的一个重要课题,本文从 Petri 网静态结构的角度出发,给出了三个层次的 Petri 网归约方法,并用代数的方法严格地证明了这些归约方法保持网的两大重要性质:活性和有界性。它们为 Petri 网的归约和分析的复杂性之间提供了一个灵活折衷的手段,能够对一个庞大、复杂的 Petri网进行不同程度的归约,以适应不同的需要。文中所给出的归约算法是基于网的关联矩阵的,具有高效,便于实现的特点。此外,本文还就多弧 Petri 网的归约问题和 Petri 网的分解问题作了简要讨论。最后还给出了哲学家用餐问题的 Petri 网新模型并对之进行归约。

On Reduction Problem of Petri Nets

Today,the reduction of petri nets is an important subject in the research area of petri nets,This paper introduces three Ievels of reduction method of petri nets according to static structure of the nets,and rigorously shows that these reduction methods maintain two imporiant properties of the nets: livencss and boundness,the methods provide us with flcxible and multifarious reduction means which can reduce a large,complex petri net to the different extents so as to adapt different requirements.In-this paper,the reduction algorithms completely based on the incidence matrix of the ncts are designed to be highly efficient and casily implemented.Besidcs,the reduction of multi -are petri nets and the decomposition of petri nets are briefly discussed. Finally,as an example,the petri net of the new version of the Dining philosophers problem is given and reduced.