Lee, Kwang-Hyung; Favrel, Joël Hierarchical reduction method for analysis and decomposition of Petri nets. (English) Zbl 0564.68047 IEEE Trans. Syst. Man Cybern. 15, 272-280 (1985). A hierarchical reduction method of Petri nets is proposed. After a brief survey on the existing methods of Petri net reduction, concepts such as reducible subnet, degree of subnet, and macronode are defined. The subnets are partially ordered by the degree of subnet, and thus the reducible subnets can be reduced orderly into the macronodes. A reduced net can be obtained without changing the properties (for example, liveness and boundedness). A sequence of reduction results in a hierarchy of reduced Petri nets that allows easy verification and hierarchical decomposition of the system. Cited in 1 ReviewCited in 3 Documents MSC: 68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) Keywords:Petri nets; degree of subnet; macronode; hierarchical decomposition PDFBibTeX XMLCite \textit{K.-H. Lee} and \textit{J. Favrel}, IEEE Trans. Syst. Man Cybern. 15, 272--280 (1985; Zbl 0564.68047) Full Text: DOI