用时序和逻辑规则形成动态故障树的紧缩Markov链  

Forming contraction Markov chain of dynamic fault tree based on timing and logical rules

作　　者：郑显举[1] 谢志萍[1] 罗航[2] 

机构地区：[1]成都电子机械高等专科学校计算机工程系,成都611730 [2]电子科技大学自动化工程学院,成都611731

出　　处：《计算机应用研究》2011年第8期3022-3025,共4页Application Research of Computers

摘　　要：针对枚举底事件的所有时序状态来形成Markov链的弊端,借鉴静态故障树的最小割集(minimum cutset,MCS)思想,考虑形成紧缩的Markov链(即最简顺序割集)。其重要目的是剔除冗余的Markov链,在保证不影响系统失效分析的同时减小状态空间,最大限度地避免陷入组合爆炸的危险。其显著特点在于用时序规则和逻辑规则来描述动态逻辑门。以此为基础,用BDD(binary decision diagram)技术首先形成基于逻辑规则的动态系统的MCS,其次对每个MCS运用时序规则,组合成必要的Markov链。实际例证表明,将MCS和时序恰当地结合起来,能够有效地获取动态故障树的紧缩Markov链。Aiming at the defect that enumerating all timing states of bottom-events to form Markov chains,the thought of MCS coming from static fault tree is used for reference to form contraction Markov chain（i.e.the most simple order cut set）.The main purpose is to eliminate redundant Markov chains,namely,to ensure making analysis to system failure is not affected at the same time reducing the state space as possible to avoid being trapped in a ＂combinatorial explosion＂ danger.The notable characteristic of the article lies in describing dynamic logic gate with timing and logical rules,and the BDD technique was used to form MCS of dynamic system based on logical rules in first step,and each MCS was combined with time-order rule to form necessary Markov chains in second step.Practical examples show that,the MCS combined with time order appropriately can automatically and effectively make contraction Markov chain of dynamic fault tree.

关 键 词：动态故障树 规则 时序 紧缩马尔可夫链 最小割集 二元决策图 

分 类 号：TP202.1[自动化与计算机技术—检测技术与自动化装置]