A graphical method for breaking logical loops based on multi-tree structure
Abstract Logical loops or circular logics, interpreted as circular supporting relations among systems, remain a longstanding challenge in the probabilistic safety assessment (PSA). Logical loops are commonly found in complex industrial systems. Due to the existence of the logical loops, the minimal cut sets cannot be directly obtained. In order to solve this problem, the logical loops should be broken properly. This paper proposes a graphical method based on multi-tree structure. By constructing the simplified multi-tree, logical loops both in linearly and non-linearly interrelated systems are solved. To illustrate this method, examples of linearly interrelated systems and non-linearly interrelated systems are given in this paper. As a supplement, this method is applied to the well-known complex logical loops in the nuclear power plant. It shows that this method is highly intuitive and efficient by means of graphs.