Minimization of Bounded Petri Net Simplification
有界Petri网的最小化化简

The concepts of language equivalence of Petri net and of minimization of bounded Petri net are presented. The equivalences of bounded Petri net, finite automaton and regular grammar is proofed, the algorithms of equivalence transition are given. The process of bounded Petri net simplification is discussed, the algorithm of simplification of bounded Petri net is given. A basic method to automated simplify the bounded Petri net is provided.