Generalized Petri Net Reduction Method
- 1 March 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 17 (2) , 297-303
- https://doi.org/10.1109/tsmc.1987.4309041
Abstract
A reduction method of generalized Petri nets is proposed. This method is a generalization of the reduction method which was previously given by Lee-Kwang and Favrel. The proposed method is defined not on the basis of the dynamic behavior but of the structure of the net, and thus the test of reducible subnet can be done by a deterministic approach. The reduction preserves the properties such as liveness, boundedness, and proper termination, and allows easy analysis of generalized Petri nets.Keywords
This publication has 8 references indexed in Scilit:
- Hierarchical decomposition of Petri net languagesIEEE Transactions on Systems, Man, and Cybernetics, 1987
- Hierarchical reduction method for analysis and decomposition of Petri netsIEEE Transactions on Systems, Man, and Cybernetics, 1985
- Additional methods for reduction and expansion of marked graphsIEEE Transactions on Circuits and Systems, 1981
- The Complexity of the Finite Containment Problem for Petri NetsJournal of the ACM, 1981
- Reduction and expansion of live and safe marked graphsIEEE Transactions on Circuits and Systems, 1980
- Petri NetsACM Computing Surveys, 1977
- On reduction of asynchronous systemsTheoretical Computer Science, 1977
- Marked directed graphsJournal of Computer and System Sciences, 1971