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

计算机科学 ›› 2011, Vol. 38 ›› Issue (4): 267-271.

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

岳昊

(漳州师范学院计算机科学与工程系漳州363000)

出版日期:2018-11-16 发布日期:2018-11-16
基金资助:
本文受国家自然科学基金项目(60673053),福建省教育厅资助科技项目(JK2010037)资助。

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

YUE Hao

Online:2018-11-16 Published:2018-11-16

摘要/Abstract

摘要： 具有多资源需求和柔性加工路径的顺序资源分配系统(Sequential Resource Allocation Systems with Multiple Resource Acquisitions and Flexible Routings,C/D-RAS)是一类较复杂的、更为一般的资源分配系统。考察了两个与 C/D-RAS密切相关的活性问题。借助这两个C/D-RAS的Petri网模型来定义标识S3 PGR2网对((N1,Mm),(N2，M02)，由标识S3 PGR2网中资源种类、数量的守恒性和变迁使能的一个充分必要条件，证明(N1 ,M01)和(N2,M02)的合法变迁发生序列是一致的，据此得出的最终结论是(N1,M01,)和(N2,M02)具有相同的活性。最后，简要提及本结论的应用。

关键词: Petri网，资源分配系统，活性

Abstract: Sequential Resource Allocation Systems with Multiple Resource Acquisitions and Flexible Routings(C/D-RAS) arc 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 S' PGRz nets pair, which is denotedby ((N1,M01)，(N2，M02)).With the help of the resource conversation attribute of the marked S3 PGRz nets and a sufficicnt 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.

Key words: Petri net, Resource allocation systems, Liveness

岳昊. 基于Petri网的顺序资源分配系统活性的一个性质[J]. 计算机科学, 2011, 38(4): 267-271. https://doi.org/

YUE Hao. Property of Liveness in Sequential Resource Allocation Systems Based on Petri Net[J]. Computer Science, 2011, 38(4): 267-271. https://doi.org/