[1]PETRI C A.Konmmunkation mit automaten[C]// Communication with Automata. Bonn:[s.n.], 1966:386-390.[2]彭建兵,焦莉.基于极小T_不变量增加的Petri网可达性分析[J].计算机应用研究,2010,27(10):3798-3802.[3]袁崇义.Petri网原理与应用[M].北京:电子工业出版社,2005.[4]李凤英,古天龙,徐周波.Petri网的符号ZBDD可达树分析技术[J].计算机学报,2009,32(12):2420-2428.[5]李志武,王安荣,贾建援.Petri网不变式和状态方程的求解[J].西安电子科技大学学报:自然科学版,2003,30(2):259-263.[6]TALAJASHI K, ONO I, SATOH H, et al. An efficient genetic algorithm for reachability problem[C]// Proceedings of the IEEE Inter-national Conference on Robotics and Automation. Piscataway, NJ: IEEE Press, 1977:89-98.[7]胡娟,刘力惠. Petri网可达性的综合判定法[J]. 软件学报,2005,15(7):949-955.[8]LAN Q Y, QIN H S, ZHANG X L. Analysis for reachability problem of bounded Petri net using key constraints method[C]// IEEE ICCA'07: Proceedings of the Sixth IEEE International Conference on Control and Automation. Washington, DC: IEEE Computer Society, 2007,2:2829-2833.[9]于枫,罗军舟,李伟.基于T_不变量消除的Petri网合法引发序列判定算法[J].解放军理工大学学报:自然科学版,2008,9(5):522-527.[10]于枫,罗军舟,李伟,等. 一种基于进程验证的Petri网可达性判定方法[J].计算机学报,2010,33(2):288-299.[11]BENASSER A,YIM P. Railway traffic planning with Petri nets and constraint programming [J]. Journal of Européen des Systèms Automatisés: JESA, 1999,33(8/9): 959-975.[12]BOURDEAUDHUY T, HANAFI S, YIM P. Solving the Petri nets reachability problem using the logical abstraction technique and mathematical programming [C]// CPAIOR'04, LNCS 3011. Berlin: Springer, 2004:112-126.[13]BOURDEAUDHUY T, YIM P, HANAFI S. Efficient reachability analysis of bounded Petri nets using constraint programming [C]// 2004 IEEE International Conference on Systems, Man and Cybernetics. Piscataway, NJ: IEEE Press, 2004,2:1870-1875.[14]DRISS O B, YIM P, KORBAA O, et al.Reachability search in timed Petri nets using constraint programming systems [C]// 2004 IEEE International Conference on Systems, Man and Cybernetics. Piscataway, NJ: IEEE Press, 2004,5:4923-4928.[15]覃海生,蓝乾艺,杨夏妮. 基于约束程序的变迁约束可达问题判定研究[J]. 广西大学学报:自然科学版, 2007, 32(3): 307-311. |