Abstract: 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 subprocesscs, 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 algorithm was proposed to construct the process expression of a Petri net synchronized by a set of S-nets.

Key words: Bounded pctri net, Process expression, Basic subprocess, S-net