An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph
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 reachab...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-10-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2073-8994/10/10/454 |
| _version_ | 1798034851034562560 |
|---|---|
| author | Kai-Qing Zhou Li-Ping Mo Lei Ding Wei-Hua Gui |
| author_facet | Kai-Qing Zhou Li-Ping Mo Lei Ding Wei-Hua Gui |
| author_sort | Kai-Qing Zhou |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-11T20:50:08Z |
| format | Article |
| id | doaj.art-6587b82cc44348f0ac507293f4127fbd |
| institution | Directory Open Access Journal |
| issn | 2073-8994 |
| language | English |
| last_indexed | 2024-04-11T20:50:08Z |
| publishDate | 2018-10-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Symmetry |
| spelling | doaj.art-6587b82cc44348f0ac507293f4127fbd2022-12-22T04:03:52ZengMDPI AGSymmetry2073-89942018-10-01101045410.3390/sym10100454sym10100454An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or GraphKai-Qing Zhou0Li-Ping Mo1Lei Ding2Wei-Hua Gui3College of Information Science and Engineering, Jishou University, Jishou 416000, Hunan, ChinaCollege of Information Science and Engineering, Jishou University, Jishou 416000, Hunan, ChinaCollege of Information Science and Engineering, Jishou University, Jishou 416000, Hunan, ChinaCollege of Information Science and Engineering, Central South University, Changsha 410083, Hunan, ChinaFuzzy 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.http://www.mdpi.com/2073-8994/10/10/454fuzzy Petri net (FPN), reachability treeand/or graphmodelingequivalent |
| spellingShingle | Kai-Qing Zhou Li-Ping Mo Lei Ding Wei-Hua Gui An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph Symmetry fuzzy Petri net (FPN), reachability tree and/or graph modeling equivalent |
| title | An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph |
| title_full | An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph |
| title_fullStr | An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph |
| title_full_unstemmed | An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph |
| title_short | An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph |
| title_sort | automatic algorithm to generate a reachability tree for large scale fuzzy petri net by and or graph |
| topic | fuzzy Petri net (FPN), reachability tree and/or graph modeling equivalent |
| url | http://www.mdpi.com/2073-8994/10/10/454 |
| work_keys_str_mv | AT kaiqingzhou anautomaticalgorithmtogenerateareachabilitytreeforlargescalefuzzypetrinetbyandorgraph AT lipingmo anautomaticalgorithmtogenerateareachabilitytreeforlargescalefuzzypetrinetbyandorgraph AT leiding anautomaticalgorithmtogenerateareachabilitytreeforlargescalefuzzypetrinetbyandorgraph AT weihuagui anautomaticalgorithmtogenerateareachabilitytreeforlargescalefuzzypetrinetbyandorgraph AT kaiqingzhou automaticalgorithmtogenerateareachabilitytreeforlargescalefuzzypetrinetbyandorgraph AT lipingmo automaticalgorithmtogenerateareachabilitytreeforlargescalefuzzypetrinetbyandorgraph AT leiding automaticalgorithmtogenerateareachabilitytreeforlargescalefuzzypetrinetbyandorgraph AT weihuagui automaticalgorithmtogenerateareachabilitytreeforlargescalefuzzypetrinetbyandorgraph |