A modified reachability tree approach to analysis of unbounded Petri nets

A modified reachability tree approach to analysis of unbounded Petri nets
复制标题

DOI：
10.1109/tsmcb.2003.811516
复制
发表时间：
2004-02
期刊：
IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society
影响因子：
--
通讯作者：
Fei-Yue Wang;Yanqing Gao;Mengchu Zhou
Fei-Yue Wang;Yanqing Gao;Mengchu Zhou
中科院分区：
其他
文献类型：
--
作者：
Fei-Yue Wang;Yanqing Gao;Mengchu Zhou

文献摘要

被引文献

相似文献

可达树，特别是相应的由Petri网生成的Karp-Miller有限可达树，是系统地研究Petri网建模的系统的许多特征（如有界性、活动性和性能）的基础。然而，在FRT中丢失了太多的信息，使得它对许多应用程序都很有用。本文引入了Petri网的改进可达树（MRT），扩展了Karp-Miller的frt在解决活动性、死锁和可达性问题以及定义或确定可能的发射序列方面的能力。证明了MRT的有限性，并举例说明了MRT相对于FRT的优越性。
Reachability trees, especially the corresponding Karp-Miller's finite reachability trees generated for Petri nets are fundamental for systematically investigating many characteristics such as boundedness, liveness, and performance of systems modeled by Petri nets. However, too much information is lost in a FRT to render it useful for many applications. In this paper, modified reachability trees (MRT) of Petri nets are introduced that extend the capability of Karp-Miller's FRTs in solving the liveness, deadlock, and reachability problems, and in defining or determining possible firing sequences. The finiteness of MRT is proved and several examples are presented to illustrate the advantages of MRT over FRT.