无界Petri网的可达树的综述  

A Survey of Reachability Trees of Unbounded Petri Nets

作　　者：干梦迪 王寿光[1] 周孟初[2,3] 李俊[4] 李月[1] 

机构地区：[1]浙江工商大学信息与电子工程学院 [2]同济大学电子与信息工程学院 [3]新泽西理工学院电子与计算机工程系 [4]东南大学自动化学院

出　　处：《自动化学报》2015年第4期686-693,共8页Acta Automatica Sinica

基　　金：国家自然科学基金(61374148;61100056;61374069);浙江省杰出青年基金(LR14F020001);浙江省科技计划项目(2013C31111);浙江省新型网络标准与应用技术重点实验室(2013E10012)资助~~

摘　　要：Petri网自提出以来得到了学术界和工业界的广泛关注.Petri网系统的可达性是最基本性质之一.系统的其他相关性质都可以通过可达性进行分析.利用等价的有限可达树来研究无界Petri网可达性,依然是一个开放性问题.该研究可以追溯到40年前,但由于问题本身的复杂性和难度太大,直到最近20年,经过国内外诸多学者的不懈努力,才逐渐取得了一些阶段性的成果和部分突破.本文回顾了近40年来国内外学者为彻底解决该问题作出的贡献.重点对4种开创性的研究成果展开讨论,分别为有限可达树、扩展可达树、改进可达树及新型改进可达树.探讨了今后无界Petri网可达性问题的研究方向.In recent years both industry and academia have paid much attention to the theory and applications of Petri nets. Reachability is a basic property of a Petri net, and many properties can be analyzed via it. However, analyzing the reachability problem of unbounded Petri nets by finite reachability trees has been an open problem since the inception of Petri nets. Researchers began to study the problem of reachability trees over 40 years ago. However, they made only limited progress over the last 20 years due to its complexity and di-culty. We present an overview of some important contributions toward its solution. The focuses are on four novel finite reachability trees： finite reachability tree （FRT）, augmented reachability tree （ART）, modified reachability tree （MRT） and new modified reachailbity tree （NMRT）. The paper concludes with a discussion of directions for future research of the reachability problem of unbounded Petri nets.

关 键 词：无界Petri网 可达树 可达性问题 离散事件系统 

分 类 号：TP301.1[自动化与计算机技术—计算机系统结构]