Research on key problems in damage tree analysis
Yang Yun-guang · Systems engineering and electronics · 2009
The fast damage locating and bottom events occurring together are two key problems in the process of damage tree analysis.In order to solve the problem of fast damage locating,the feasibility of applying Bayesian networks to damage tree analysis is analyzed.The translation from damage tree to Bayesian networks is accomplished based on the event to node mapping and the logic gate to link intensity mapping.The fast damage locating is performed by the theory of network belief updating.In order to solve the problem of bottom events occurring together,the damage correlation coefficient between one part and another part is calculated according to the data that are obtained by the help of battlefield damage simulation experiments,and the bottom events related to the biggish correlation coefficient constitute one bottom event.The application of the two methods in damage tree analysis is illustrated by an example.