Computer Science ›› 2016, Vol. 43 ›› Issue (11): 98-101.doi: 10.11896/j.issn.1002-137X.2016.11.018

Previous Articles     Next Articles

Developing Graph and Generating Algorithm for Constant Continuous Petri Net with Effective Conflict

ZHAO Yi-jun and ZHANG Xiao-xuan   

  • Online:2018-12-01 Published:2018-12-01

Abstract: Maximum constant continuous Petri net(CCPN),one of the timed continuous Petri net models,was first put forward by David.An efficient way for analysis of CCPN properties is developing graph of CCPN.However,for CCPN with effective conflict,it makes the construction of developing graph become more difficult because of the uncertainty of transition excitation caused by effective conflict.Based on the two kinds of solutions for effective conflict-determining priority or distributing flow in proportion,algorithm 2 for calculating the velocity of every transition was presented,and generating algorithm 3 of developing graph was further put forward for bounded CCPN with effective conflict.By means of which,analysis can be made for analyzing the properties of CCPN with effective conflict.

Key words: Maximum constant continuous Petri net,Strongly(Weakly) enabled,Effective conflict,Instantaneous firing velocity,Functioning interval,Developing graph,Algorithm

[1] David R,Alla H.佩特利网和逻辑控制器图形示工具[M].黄建文,赵不贿,译.北京:机械工业出版社,1996
[2] David R,Alla H.Petri Nets and Grafcet:Tools for ModelingDiscrete Event System[M].London:Pretice-Hall,1992
[3] Zhao Yi-jun.Propertries and Determining Methods of Conti-nuous Petri Nets[D].Taian:Shandong Mining Institute and Technology,1998(in Chinese) 赵义军.连续Petri网的性质及判定方法[D].泰安:山东矿业学院,1998
[4] Zhao Yi-jun,Wang Pei-liang.Developing Graph and Generating Algorithm of CCPN[J].Computer Science,1999,6(6Suppl):1-6(in Chinese) 赵义军,王培良.CCPN的演变图及其构造算法[J].计算机科学,1999,26(6增刊):1-6
[5] Peter J L.Petri网理论与系统模拟[M].吴哲辉,译.徐州:中国矿业大学出版社,1989
[6] 吴哲辉.Petri网导论[M].北京:机械工业出版社,2006
[7] 袁崇义.Petri网原理[M].北京:电子工业出版社,2005
[8] David R,Alla H.Petri Net for Modeling of Dynamic Systems-A Survey[J].Automatica,1994,30(2):36-41
[9] Murata T.Petri Nets:Properties,Analysis and Applications[J].Proceedings of the IEEE,1989,77(4):541-581
[10] Li Zhi-jia,Hu Xiang,Jiao Li,et al.Performance Evaluation ofJob Scheduling and InfiniBand Network Interconnection in High Performance Computing System Based on Stochastic Petri Nets [J].Computer Science,2015,2(1):31-37(in Chinese) 李智佳,胡翔,焦莉,等.基于随机Petri网的高性能计算系统作业调度及InfiniBand网络互连的性能分析[J].计算机科学,2015,42(1):31-37

No related articles found!
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .