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

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

提出一种基于着色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.