刘歌群. 信息/求解网系统的可达图分析[J]. 微电子学与计算机, 2010, 27(12): 1-3,9.
引用本文: 刘歌群. 信息/求解网系统的可达图分析[J]. 微电子学与计算机, 2010, 27(12): 1-3,9.
LIU Ge-qun. Reachability Graph Analysis of Information/Solver Petri Net System[J]. Microelectronics & Computer, 2010, 27(12): 1-3,9.
Citation: LIU Ge-qun. Reachability Graph Analysis of Information/Solver Petri Net System[J]. Microelectronics & Computer, 2010, 27(12): 1-3,9.

信息/求解网系统的可达图分析

Reachability Graph Analysis of Information/Solver Petri Net System

  • 摘要: 研究信息/求解扩展Petri网系统(I/S系统)可达图的生成问题及基于可达图的活性分析问题.给出了I/S系统与活性相关的几个定义,提出了I/S系统可达图的定义及生成算法,基于可达图给出了关于系统活性的几个定理.最后举例验证了可达图生成算法的有效性.

     

    Abstract: Generation of reachability graph of Information/solver extended Petri net system(I/S-system) is discussed and the system liveness analysis based on reachability graph is discussed as well.Several definitions relating to system liveness are given.Definition of reachability graph of I/S-system and its generating algorithm are presented.Several theorems about system liveness are given based on reachability graph.At last the example verifies the effectiveness of the algorithm.

     

/

返回文章
返回