Precedence tree guided search for the efficient identification of multiple situations of interest – AND/OR graph matching

An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph

“…Hence, a modified reachability tree is proposed in this section based on the and/or graph If the original problem can only be solved when solutions of multiple simple problems are simultaneously established, the relationship among these simple problems is an 'and' relation; if the original problem can be solved when multiple simple problems are established, the relationship among these simple problems is an 'or' relation; if the original problem can be solved when any simple problem is established, the relationship is called 'Simple' elation. The problem that can no longer be resolved is called the original problem [21].…”

“…To fulfil this goal, this paper includes three main phases. First, a modified reachability tree based on an and/or graph model [21], decision tree theory [22] and fuzzy relations [23] is presented to fully record the flow-relationship among places and describe the dependence relationships among places in the neighbouring layers. Furthermore, an automatic generation algorithm is proposed in this manuscript to the reachability tree for the corresponding large-scale FPN model for solving the state-explosion issue.…”

“…FPR is commonly used to represent the uncertainties in expert systems[20][21][22]. General FPRs are formalized and described as follows.…”