摘要
Petri网本原可重复向量是一个重要结构性质.本文定义了网N的可重复向量表出集pre-SPRV(N),证明一个网的本原可重复向量集是唯一的,并且给出它的一个求解算法.算法首先求出网N变迁扩充网的所有极小T-不变量,由此求得N的一个可重复向量表出集,然后依次考察其中的每一个向量,将其中的多余向量去掉,得出网N的本原可重复向量集.最后算法被实现并用于实例以展示算法性能,相关算法的程序实现可以作为已有Petri网分析工具的一个组件.
The Prirnitive Repetitive Vector of a Petri net is an essential structural property. The concept of the presenting set of repetitive vector （pre-SPRV（N）） is proposed in this paper. It is proved that the set of Primitive Repetitive Vector of a net （SPRV（N）） is unique and an algorithrn is proposed to obtain SPRV（N）. Firstly, the algorithm obtains all the minimal T-invariants of the transition extended net of a net N and the pre-SPRV（N）. Secondly, the vectors in the pre-SPRV（N） are checked one by one and the redundant vectors are eliminated, thus, the SPRV（N） is obtained. Finally, the algorithm is implemented and verified by an example in order that its performance is evaluated. The corresponding procedure can be used as a component of Petri nets analysis tools.
出处
《小型微型计算机系统》
CSCD
北大核心
2009年第9期1815-1818,共4页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(60673053)资助
关键词
PETRI网
本原可重复向量集
算法
Petri nets
the set of primitive repetitive vector of a net （SPRV（N））
algorithm
