Computer-based realization method of cut set non-intersection in fault tree analysis

Abstract

The invention provides a computer-based realization method for acquiring the minimal cut sets of a top event through the Boole function of a fault tree and carrying out non-intersection treatment on the minimal cut sets. The basic method of the non-intersection treatment comprises the steps of: dividing one event into the sum of subevents and complementary events thereof, and carrying out a plurality of such operation on intersecting events until non-intersection events are obtained through division. The computer-based realization method is realized by mapping the minimal cut sets into one set of n-dimensional vectors and defining an operation, corresponding to the intersection operation among the minimal cut sets, in the set. The computer-based realization method has the following characteristics that (1) as long as the minimal cut sets are coded, the coded minimal cut sets can be input into a computer and then subjected to the non-intersection treatment automatically by the computer, so that the automation degree is high, and no manual intervention is needed; and (2) the minimal cut set with the fewest bottom events is preferentially selected as the non-intersection minimal cut set, so that the number of the minimal cut sets is reduced after non-intersection treatment, and the top event failure probability is simpler to calculate.

Description

technical field [0001] The invention relates to a computer implementation method of cut set disjointization in fault tree analysis Background technique [0002] Fault tree analysis is a standard method for evaluating and improving reliability and safety, and has been widely used in aerospace, nuclear energy, electronics, electric power, chemical industry, railway, transportation and insurance industries. Both the early Fussell-Vesely algorithm and the Semanderes algorithm can use the Boolean absorption strategy to obtain the minimum cut set of the top event, which is feasible and effective in the qualitative analysis of fault trees. However, in order to perform quantitative analysis on fault trees, the minimum cut set of top events must be disjointized first. However, the inclusion-exclusion theorem for the disjoint processing of minimal cut sets is an "NP" problem, the main reason is that the same bottom event in different cut sets may lead to a sharp increase in the amoun...

AI Technical Summary

Problems solved by technology

Many scholars have carried out research on BDD-based fault tree analysis and achieved some results, but there are still many deficiencies and unresolved problems in BDD-based fault tree analysis. First, the sequence of bottom event indicators has a greater impact on the scale of BDD. At present, there is no method to solve the sorting problem, and the fault tree module also needs manual analysis; secondly, the tree building method has poor versatility and a large amount of calculation, which cannot be completely realized by computer

Images