摘要 : This paper presents an approximate algorithm based on simulated annealing to achieve the maximum probability of the minimal cut sets for a fault tree. Near optimal minimal cut sets and impor- tant sequence of the basic events are ... 展开 This paper presents an approximate algorithm based on simulated annealing to achieve the maximum probability of the minimal cut sets for a fault tree. Near optimal minimal cut sets and impor- tant sequence of the basic events are also solved by the method. Computer simulation show that the algorithm performs very well. 收起