Abstract: 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 proce

Key words: Petri net,Language equivalence, Minimization, Simplification