摘要
讨论无冲突带抑制弧Petri网结构活性的判定条件,即证明一个结构活的网,扩充为带抑制弧的网后仍然活当且仅当生成的抑制弧网具有持续性.给出一个已知结构活的带抑制弧网的极小活标识的配置算法,将网的极小活标识配置最终转化为环路中极小活标识的求解.与传统方法相比,新算法不仅易于程序实现,且时间复杂度是多项式的.
The liveness issues concerning conflict-free Petri nets with inhibitor is discussed. We proved that a structural live net is still live if and only if the property of persistency holds. This paper presented an assignment of minimal live marking algorithm for structural live Petri net with inhibitor arcs. The minimal live marking issue is transferred into the assignment of marking for the cycle. Compared with traditional methods, the new algorithm is more easy to program, and the time complexity is polynomial.
出处
《华侨大学学报（自然科学版）》
CAS
北大核心
2011年第5期525-528,共4页
Journal of Huaqiao University(Natural Science)
基金
福建省厦门市科技计划创新项目(3502Z20103027)
华侨大学高层次人才科研启动项目(09BS514)
关键词
抑制弧
PETRI网
结构活
极小活标识
配置算法
inhibitor arcs
Petri net
structural live
minimal live marking
assignment algorithm
