Petri网可达性的综合判定法-软件学报.PDF

1000-9825/2004/15(07)0949 ©2004 Journal of Software 软 件 学 报 Vol.15, No.7 ∗ Petri 网可达性的综合判定法 + 胡 娟 , 刘力惠, 范植华, 李 磊, 王常青, 周纬杰 ( 中国科学院 软件研究所,北京 100080) Analysis for Reachability Problem of Petri Net + HU Juan , LIU Li-Hui, FAN Zhi-Hua, LI Lei, WANG Chang-Qing, ZHOU Wei-Jie (Institute of Software, The Chinese Academy of Sciences, Beijing 100080, China) + Corresponding author: Phn: +86-10ext 102, E-mail: juanhchina@, Received 2003-12-23; Accepted 2004-03-31 Hu J, Liu LH, Fan ZH, Li L, Wang CQ, Zhou WJ. Analysis for reachability problem of Petri net. Journal of Software, 2004,15(7):949~955. /1000-9825/15/949.htm Abstract: The marking’s reachability problem is one of the basis problems in Petri net analysis. As the conventional methods for solving it may not insure the exactitude of the outcome, the essential of the reachability problem is pointed out in this paper. Besides, the different connected areas are plotted out and the reachability of markings in the same connected areas of marking graph is discussed. Finally,an effective method for solving the marking’s reachability problem is presented as the conclusion of the whole work, which can be used for ordinary nets. This method preserves the virtues of the conventional methods, takes the advantage of the Gröbner basis algorithm, and can insure the exactitude of the outcome. Key words: Petri net; reachability; Gröbner basis 摘 要: Petri 网标识的可达性判定问题是进行Petri 网分析的基础,而传统的判定方法并不能确保所得结果的 可靠性.在揭示Petri 网可达性问题的实质之后,讨论了在标识图的同一连通域内标识可达性的判定问题,进而在 分析相关原理的基础上提出了一种有效判定 Petri 网标识可达性的“综合判定法”.此判定方法综合多种传统判 定方法的优点,结合Gröbner 基理论,确保了对Petri 网标识可达性进行判定所得结果的可靠性. 关键词: Petri 网;可达性;Gröbner 基 中图法分类号: TP301 文献标识码: A