A novel reduction approach for Petri net systems based on matching theory

Authors:
Victor R. L. Shen;Yu Fang Chung;Shyi-Ming Chen;Jhong-Yi Guo
Affiliations:
Department of Computer Science and Information Engineering, College of Electrical Engineering and Computer Science, National Taipei University, 151, University Rd., Sanhsia, New Taipei City 237, T ...;Department of Electrical Engineering, Tunghai University, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan;Graduate Institute of Communication Engineering, College of Electrical Engineering and Computer Science, National Taipei University, 151, University Rd., Sanhsia, New Taipei City 237, Taiwan
Venue:
Expert Systems with Applications: An International Journal
Year:
2013

Citing 10
Cited 0

Modeling and analysis of a virtual reality system with time Petri nets

Proceedings of the 20th international conference on Software engineering
Efficient algorithms for Petersen's matching theorem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Reduction Methods for Real-Time Systems Using Delay Time Petri Nets

IEEE Transactions on Software Engineering
Petri Net Theory and the Modeling of Systems

Petri Net Theory and the Modeling of Systems
Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis

IEEE Transactions on Software Engineering
Graph Theory: Modeling, Applications, and Algorithms

Graph Theory: Modeling, Applications, and Algorithms
Knowledge sharing in dynamic virtual enterprises: A socio-technological perspective

Knowledge-Based Systems
Self-adaptive stepsize search for automatic optimal design

Knowledge-Based Systems
Modeling and performance analysis using extended fuzzy-timing Petrinets for networked virtual environments

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Supervised and Unsupervised Learning by Using Petri Nets

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	12.05

Visualization

Abstract

In this paper, an efficient method is presented to solve the state explosion problem in Petri nets by using matching theory. It is difficult to analyze a Petri net when there are too many existing states. In order to solve such a problem, it is addressed to label a weight value on a transition according to the relationship between a place and a transition. Then, the transition with the largest weight value is selected. The selected transition is the most important and connective in the entire Petri net. After selecting each transition for several times, the last one denotes the least connective in the whole Petri net and the redundant place is obtained. Furthermore, the Petri net model can be reduced by fusing the transition with the largest weight value and the redundant place. In this novel approach, an incidence matrix, a weight vector, a matching matrix, a compressed incidence matrix, and a reduced and compressed incidence matrix are sequentially built based on the original Petri net model so as to obtain a reduced and compressed Petri net model. Finally, the experimental results regarding the CAVE automatic virtual reality environment demonstrate the high viability of the proposed approach.