含有效冲突的恒定连续Petri网演变图及构造算法  

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

作　　者：赵义军[1] 张小轩[1] 

机构地区：[1]山东科技大学数学与系统科学学院,青岛266590

出　　处：《计算机科学》2016年第11期98-101,共4页Computer Science

基　　金：国家自然科学基金(61304074)资助

摘　　要：最大速度恒定的连续Petri网(CCPN)是由David首先提出的一类时延连续Petri网模型,构造其演变图是对其性质进行分析的一种有效方法。而对于含有效冲突的最大速度恒定的连续Petri网,由于有效冲突所引起的变迁激发的不确定性,使得构造演变图变得较为困难。基于有效冲突的两种解决方式——确定优先级或按比例分配流量,给出了计算各变迁瞬发速度的算法2;进而对含有效冲突且有界的CCPN,提出了演变图构造算法3,利用其演变图,可以对含有效冲突的CCPN进行性能分析。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 2for 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.

关 键 词：最大速度恒定的连续Petri网 强(弱)使能 有效冲突 瞬发速度 运行区间 演变图 算法 

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