Petri网的空标识及相关性质研究

Empty Marking of Petri Net and Related Properties

在一个网系统中,如果每个库所中的标志数都等于0,则说这个网系统中的标识是一个空标识。文[1]通过例子指出空标识可以是一个网系统的初始标识,也可以是具有非空初始标识的网系统的一个可达标识。文[2]讨论了空标识的再现性。本文给出了空标识在网系统运行过程中重复出现的一个例子,并对上述3种情况的实际背景以及相关的网结构性质进行了讨论。

A marking M is said to be an empty marking in a Petri net ∑= （S, T; F, M） if M（s） = 0 for every s∈S[1]. An empty marking may be an initial marking of a net system, or a reacheable marking for a net system of which the initial marking is not empty[1]. Reproducibility of empty marking is discussed by [2]. We indicate that an empty marking mary also be a repetitive marking in some net systems in this paper. Moreover, the physical background of empt markings in three ease above are discussed, some properties of net structure related to the empty markings are proven.