【作者】 高茜； 周大均； 李爱民；

【Author】 Gao Qian Zhou Da-jun Li Ai-min Shandong Institute of light Industry,center of modern education technoloy,Jinan,250353

【机构】 山东轻工业学院现代教育技术中心；

【摘要】 Petri网是一种系统描述和分析的工具。在Petri网的诸多性质研究中,可达性研究大概是最基本的一个动态性质研究。可达性在一定意义上可说是研究Petri网其它动态性质的基石,许多其它问题都可以通过可达性问题来叙述。通过对加权无界Petri网进行研究,本文找出了不能仅靠可覆盖性树对无界Petri网的可达性进行判定的原因。基于通过使用某个关于正整数的表达式去代替代表任意正整数的ω来减少这种"跨度"的思想,对可覆盖性树的节点作了一些适当的改进,通过将可覆盖性树中的节点细化为:序列节点、复制节点、准复制节点的方法,从而令无界Petri网运行过程中的信息丢失减小,为一个任意的Petri网(包括无界Petri网)的可达性判定方法提供了依据。更多还原

【Abstract】 Petri net is a system description and analysis tool.Reachability research is one of the most basic properties of Petri-Nets in all properties research.In a sense,reachability is the foundation of the study on other dynamic property of Petri-Nets,many problems on Petri-Nets can be described by it.In this paper,after studying the weighted unbounded Petri-Nets using global analysis method,the reason why the reachability decision of unbounded Petri-Nets can not only depends coverability tree is found.Based on idea of using one positive integer equation in place of any positive integer variable "ω"in order to cut the span,an improved node of coverability tree is introduced.This improved method can decrease information losing during unbounded Petri-Nets running by refining the node of coverability tree to sequence node,copied node and prospective node.So the method provide basis of the reachability decision of any Petri-Nets (include unbounded Petri-Nets).更多还原