Divide Large Scale Fuzzy Petri Net into Equivalent Sub-FPNs using Reachability Tree

Abstract

Abstract As real systems become larger and complicated, the number of nodes of fuzzy Petri net (FPN) also increases rapidly, it further indicated that the algorithm complexity of related application using FPN grows up sharply. To solve this state-explosion issue, a decomposition algorithm using reachability tree is proposed to divide a large-scale FPN model into a series of sub-FPNs in this paper. Comparison experiments show that all obtained sub-FPNs do not destroy internal reasoning paths of the original large-scale FPN and represent a complete reasoning path from input place(s) to the output place.