摘要
Petri网标识的可达性判定问题是进行Petri网分析的基础。在分析目前现有的判定Petri网可达性的求解方法的基础上,提出一种伪标识判定法。该方法在状态方程法的基础上,利用关联矩阵来判断变迁发射向量是否能够发生来筛除伪标识。通过对实例的求解说明了求解过程并证明了算法能够确保对所得结果的可靠性,减少了算法的时间复杂度。
Reachability determination of Petri net identification is the basis to carry out Petri net analysis.Based on analysing existing solutions for determining the reachability of Petri net,we propose a determination method for false identification.The method is based on the state equation method,and screens out the false identification by using the association matrix to determine whether the transition launch vector can happen.Through solving an example we illustrate the process of solution and prove that the algorithm is able to ensure the reliability of the outcome obtained and to reduce its time complexity.
出处
《计算机应用与软件》
CSCD
北大核心
2013年第4期153-155,179,共4页
Computer Applications and Software
基金
广西壮族自治区教育厅科研立项项目(201106LX515)
玉林师范学院青年科研资助项目(2010YJQN19)
关键词
PETRI网
可达性
伪标识
Petri net Reachability False identification
