Process expression of bounded Petri nets

The concept of process expression of bounded Petri nets is presented.Moreover,an algorithm to find the process expression for a bounded Petri net is given.A process expression of a bounded Petri net is a regular expression whose every alphabet symbol represents a basic subprocess of the net.The regular set expressed by the regular expression is the set of all surjective processes of a bounded Petri net.A surjective process of a bounded Petri net is a process of this net in which every s-cut corresponds to a reachable marking of the net.Therefore,all surjective processes of a bounded Petri net can be obtained as long as its process expression and the basic subprocess represented by the alphabet symbols of the process expression are given.