摘要
先行值计算是提高时延 Petri 网并行模拟性能的一个好的方法。给出了时延 Petri 网的先行值计算的四种基本结构,对于存在循环的复杂的 Petri 网结构给出了预测图算法,通过预测图,能够很容易求出静态和动态先行值,在并行模拟中利用先行值可以分析出存在并发和阻塞的结构,从而为网分块在并行机的结点上运行奠定了基础。
Lookahead computation is a good method that improves the distributed simulation performance of timed Petri nets. In the paper, we give four basic architectures about the look,ahead computation of time Petri nets, also obtain the algorithm of prediction graph to having cyclic and complex Petri nets architecture. By prediction graph, static and dynarnic lookahead can be computed easily. In distributed simulation, we can use lookahead to analyze the architecture having concurrency and blocking, which is foundation on net partitioning for running in parallel nodes.
出处
《计算机科学》
CSCD
北大核心
2006年第4期240-243,共4页
Computer Science
基金
国家自然科学基金资助项目(60173053)
安徽理工大学青年基金(2004020)