稳定有界Petri网的进程表达式

Process Expression of Stable Bounded Petri Nets

文献[1]证明一个有界Petri网的进程表达式是以该网的基本子进程集为字母表的正规表达式,然而没有给出基本子进程的求解方法。定义了一类有界Petri网———稳定有界Petri网,并给出其基本子进程的求解算法,进而利用有限自动机的语言表达式的求解方法来求解稳定有界Petri网的进程表达式。另外,还给出了由符合一定条件的S-网的进程表达式来构造其同步合成网的进程表达式的算法。

The paper[1]proved that the process expression of a bounded Petri net is a regular expression with the basic subprocess set of the net system as alphabet.However,methods for the solution of the basic subprocess set have not been proposed so far.This paper defined a class of bounded Petri nets that are named by stable bounded Petri nets（SB-PNs）.A method was presented to compute the set of basic subprocesses,and then the process expression of an SBPN could be produced by a finite state machine with the basic subprocess set of the net system as alphabet.Next,an algo-rithm was proposed to construct the process expression of a Petri net synchronized by a set of S-nets.