知识与财富的链接
面对以故障树形式汇集的大量历史事故案例,故障树结构匹配是借鉴历史经验在有限时间、人力和成本下实现对新事故准确和全面调查的有效手段。根据事件演化的时序和因果推理的结构特征,提出一种故障树结构匹配算法。通过构造故障树结构匹配的隐马尔可夫模型,利用维特比算法预测待匹配序列的最佳序列。实验数据显示,相对于基于节点的结构匹配算法,该算法在匹配的准确性、结构缺陷的检测效果等方面有显著提升。
A large number of fault trees have been designed and stored with the occurrence of numerous historical accident cases.Structure matching is an effective way to achieve accurate and comprehensive investigation of new accidents by using the existing fault trees with the limited time,manpower and cost.Based on the timing of event evolution and the structural features of causal reasoning,a fault tree structure matching algorithm was proposed.The hidden Markov model of fault tree is constructed and then the Viterbi algorithm is used to predict the optimal matching sequences.Compared with the node-based structure matching algorithm,this algorithm has significant improvement in the accuracy of matching and the detection of structural defects.
