摘要
由于Petri网的满进程只能刻画Petri网的一段运行,因此只能计算一部分可达标识,为了能够计算一个Petri网的全部可达标识,理论界提出进程表达式和进程网的方法.文中引入全进程Petri网的概念,目的是使Petri每一个标识都在全进程中得到计算,从而提供了一种计算标识的简便方法,避免利用进程表达式计算所有标识时需要的复杂计算,证明了一类可逆的有界Petri网(M0网)是全进程Petri网.
Since the full process of Petri net can only describe a section of operation of Petri net, only a part of reachable identifiers can be calculated. In order to solve this problem, the methods of process expression and process net are proposed. In this paper, the concept of whole process Petri net is introduced in order to make each identifier of Petri net be calculated in the whole process, so as to provide a simple method to calculate the identifier and avoid the complex calculation required when calculating all identifiers by process expression. It is proved that a class of reversible bounded Petri nets(M0 nets) is a whole process Petri nets.
作者
刘萍
LIU Ping(Department of Computer Science,Gansu Normal College for Nationalities,Hezuo Gansu 747000)
出处
《甘肃高师学报》
2021年第5期8-10,共3页
Journal of Gansu Normal Colleges
基金
甘肃民族师范学院校长基金项目“有界Petri网完全进程的研究”(GSNU-YZKY-1902).
关键词
可逆的有界Petri网
出现网
满进程
全进程
标识圈
invertible bounded Petri nets
occurrence net
full process
whole process
marked circle
