基于约束优化的Petri网可达性分析  

Reachability analysis of Petri net based on constraint optimization

作　　者：杨夏妮[1] 龙法宁[1] 张远夏[1] 

机构地区：[1]玉林师范学院计算机科学与工程学院,广西玉林537000

出　　处：《计算机应用》2013年第4期1128-1131,共4页journal of Computer Applications

基　　金：广西壮族自治区教育厅科研项目(201106LX515);玉林师范学院青年科研项目(2010YJQN19);玉林师范学院专项(2012YJZX04)

摘　　要：Petri网的可达性判定问题是进行Petri网分析的基础。通过分析目前求解Petri网可达问题的判定方法和基于约束程序的Petri网可达问题判定方法,提出一种基于约束优化的Petri网可达问题判定方法,该方法是在状态方程法的基础上,利用约束程序寻求可行解,再利用优化求最优解,从而减少问题搜索的分支,达到减少状态方程的解空间的目的。最后通过实例的求解验证算法能够提高判定效率。The judgment of reachability is one of the fundamental issues in Petri net analysis.The paper analyzed the existing method and the method based on constraint programming for the reachability of Petri net,and then proposed the judgment method for reachability problem based on constraint optimization.The method was based on the state equation method,separately using the constraint programming and the optimization to seek the feasible solution and the optimal solution,thereby decreased the searching path and attained the purpose of reducing the solution space of the state equation.Finally an example was given to prove that the algorithm can improve the determination efficiency.

关 键 词：PETRI网 可达性 状态方程 约束 优化 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]