Open AccessDivide Large Scale Fuzzy Petri Net into Equivalent Sub-FPNs using Reachability Tree
Author(s) -
Bi-Yu Liu,
Kailiang Zhou,
Sharifah Zarith Rahmah Syed Ahmad
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/864/1/012062
Subject(s) - reachability , petri net , tree (set theory) , computer science , decomposition , net (polyhedron) , scale (ratio) , path (computing) , fuzzy logic , state (computer science) , algorithm , theoretical computer science , mathematics , artificial intelligence , programming language , combinatorics , chemistry , physics , geometry , organic chemistry , quantum mechanics
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.