本文選題：故障樹(shù)分析　切入點(diǎn)：二元決策圖　出處：《西安理工大學(xué)學(xué)報(bào)》2016年01期

【摘要】：提出了一種底事件排序的新方法——最小深度子樹(shù)法。該方法先將結(jié)構(gòu)復(fù)雜的故障樹(shù)化簡(jiǎn)為一棵簡(jiǎn)單的樹(shù),然后基于各子樹(shù)的深度、節(jié)點(diǎn)數(shù)及節(jié)點(diǎn)間的位置關(guān)系對(duì)底事件進(jìn)行靜態(tài)排序,并根據(jù)排序結(jié)果動(dòng)態(tài)構(gòu)造BDD。最后,通過(guò)對(duì)航空發(fā)動(dòng)機(jī)加速時(shí)喘振停車(chē)的故障樹(shù)分析,證明該方法可快速構(gòu)建BDD,而且構(gòu)建的BDD產(chǎn)生的冗余節(jié)點(diǎn)數(shù)目較少。
[Abstract]:In this paper, a new method of bottom event sequencing, the minimum depth subtree method, is proposed, in which the fault tree with complex structure is reduced to a simple tree, and then based on the depth of each subtree. The number of nodes and the relationship between nodes are used to sort the bottom events statically, and the BDD is constructed dynamically according to the sorting results. Finally, the fault tree analysis of aero-engine acceleration surge parking is carried out. It is proved that this method can construct BDD quickly, and the number of redundant nodes generated by the constructed BDD is small.
【作者單位】： 西安理工大學(xué)計(jì)算機(jī)科學(xué)與工程學(xué)院;西安理工大學(xué)自動(dòng)化與信息工程學(xué)院;
【基金】：國(guó)家自然科學(xué)基金資助項(xiàng)目(61273127,U1334211,U1534208) 高等學(xué)校博士學(xué)科點(diǎn)專(zhuān)項(xiàng)科研基金資助項(xiàng)目(20116118110008)
【分類(lèi)號(hào)】：V263.6
，

本文編號(hào)：1695972