Paper Info
Title
An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph.
Abstract
Fuzzy Petri net (FPN) is widely used to repre sent, model and analyse knowledge-based systems (KBSs). Meanwhile, a reachability tree is an important tool to fully represent the flow relationship of FPN and is widely applied to implement inference in industrial areas. However, the traditional reachability ignores recording the dependence relationships ('and/or' relationship) among the places in the neighbouring layers. This paper develops a modified reachability tree based on an and/or graph and presents a three-phase generation algorithm to model the reachability tree for the corresponding FPN automatically via fuzzy production rules (FPRs). Four cases are used to verify the correctness and feasibility of the proposed algorithm from different viewpoints, such as general FPRs, FPRs with a condition-sharing situation, FPRs with a conclusion-sharing situation, and FPRs with multi-conclusions. Simulation results reveal that the proposed approach has the ability to automatically generate the reachability tree for the corresponding FPN correctly.
Year
DOI
Venue
2018
10.3390/sym10100454
SYMMETRY-BASEL
Keywords
Field
DocType
fuzzy Petri net (FPN),reachability tree,and / or graph,modeling,equivalent
Graph,Inference,Correctness,Fuzzy logic,Fuzzy petri nets,Algorithm,Reachability,Mathematics
Journal
Volume
Issue
ISSN
10
10
2073-8994
Citations 
PageRank 
References 
0
0.34
12
Authors
4
Name
Order
Citations
PageRank
Kai-Qing Zhou1175.05
Li-Ping Mo2122.27
Lei Ding314226.77
Weihua Gui457790.82