基于着色Petri网的双向搜索关键路径算法  

Algorithm for Bidirectional Searching for Critical Paths Based on Colored Petri Net

作　　者：杨夏妮[1] 

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

出　　处：《玉林师范学院学报》2014年第2期100-105,共6页Journal of Yulin Normal University

基　　金：广西壮族自治区教育厅科研立项项目(201106LX515)

摘　　要：提出一种基于着色Petri网的双向搜索关键路径算法,首先将AOE网转换成带时间状态的着色Petri网,然后运行带时间状态的着色Petri网,分别从源点和汇点双向搜索关键路径,最后给出了对典型实例的仿真实验,结果验证了双向搜索关键路径算法的执行效率优于传统单向搜索关键路径算法.The paper proposed the algorithm for bidirectional searching for critical paths based on Colored Petri Net. Firstly, the AOE net was converted into the Colored Petri Net with time state. Second, Colored Petri Net with time state was operated from the source and the sink to search for the critical paths. Finally, the simulation experiment of the typical examples was given. The experimental result verified the execution efficiency of the algorithm for bidirectional searching for critical paths based on colored petri net is better than the traditional algorithm for one-way searching.

关 键 词：着Petri 关键路径 双向搜索 AOE网 

分 类 号：TP393.027[自动化与计算机技术—计算机应用技术]