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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
