基于Petri网的顺序资源分配系统活性的一个性质  

Property of Liveness in Sequential Resource Allocation Systems Based on Petri Net

作　　者：岳昊[1] 

机构地区：[1]漳州师范学院计算机科学与工程系,漳州363000

出　　处：《计算机科学》2011年第4期267-271,共5页Computer Science

基　　金：国家自然科学基金项目(60673053);福建省教育厅资助科技项目(JK2010037)资助

摘　　要：具有多资源需求和柔性加工路径的顺序资源分配系统(Sequential Resource Allocation Systems with MultipleResource Acquisitions and Flexible Routings,C/D-RAS)是一类较复杂的、更为一般的资源分配系统。考察了两个与C/D-RAS密切相关的活性问题。借助这两个C/D-RAS的Petri网模型来定义标识S3PGR2网对((N1,M01),(N2,M02)),由标识S3PGR2网中资源种类、数量的守恒性和变迁使能的一个充分必要条件,证明(N1,M01)和(N2,M02)的合法变迁发生序列是一致的,据此得出的最终结论是(N1,M01)和(N2,M02)具有相同的活性。最后,简要提及本结论的应用。Sequential Resource Allocation Systems with Multiple Resource Acquisitions and Flexible Routings（C/D-RAS） are a kind of common system with higher complexity.The liveness problems of two C/D-RAS were investigated in this paper.The Petri net models of the two C/D-RAS were defined as the marked S3PGR2 nets pair,which is denoted by（（N1,M01）,（N2,M02））.With the help of the resource conversation attribute of the marked S3PGR2 nets and a sufficient and necessary condition of transition enabling,it was proved that the legal firing sequences of transitions in（N1,M01） and（N2,M02） are consistent.As a result,the final conclusion tells us that（N1,M01） is live,if and only if（N2,M02） is live.Finally,the potential application of the conclusion was briefly introduced.

关 键 词：PETRI网 资源分配系统 活性 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]