Computer Science ›› 2017, Vol. 44 ›› Issue (9): 195-199.doi: 10.11896/j.issn.1002-137X.2017.09.037

Previous Articles     Next Articles

Method of SBDD Based on Dynamic Fault Tree

ZHANG Xiao-ce, YAN Xue-feng and ZHOU Yong   

  • Online:2018-11-13 Published:2018-11-13

Abstract: When analyzing the dynamic fault tree of Pandora,the method of SBDD doesn’t take into account the complex relations between events.It causes that the generated SBDD has invalid branches where there are invalid cut sets in the non-intersect minimum cut sets.Aiming at this problem,an improved method of SBDD was proposed in this paper which can remove invalid node dynamically and avoid invalid branches.The improved method of SBDD mainly includes two aspects,the relation sorting method based on the structure sorting method and the dynamic optimization generation algorithm of SBDD.The basic idea of the relation sorting method is giving the events different sorting priority based on the structure relations of the fault tree and the relationship between events.The dynamic optimization generation algorithm of SBDD is used to calculate the SBDD based on the event sequencing queue.In the process of calculation,the algorithm removes invalid node dynamically and makes the results don’t contain invalid cuts.Experiments show that the SBDD generated by the improved method of SBDD is smaller and the non- intersect minimum cut sets are less and don’t contain invalid sets in a approximate time.

Key words: Pandora,Dynamic fault tree,Method of SBDD,Generation algorithm of SBDD,Relation sorting method

[1] WALKER M D.Pandora:a logic for the qualitative analysis of temporal fault trees[D].The University of Hull,2009.
[2] WALKER M,PAPADOPOULOS Y.Synthesis and analysis oftemporal fault trees with PANDORA:The time of Priority AND gates[J].Nonlinear Analysis:Hybrid Systems,2008,2(2):368-382.
[3] GE D,LIN M,YANG Y,et al.Quantitative analysis of dynamic fault trees using improved Sequential Binary Decision Diagrams[J].Reliability Engineering & System Safety,2015,142:289-299.
[4] RUIJTERS E,STOELINGA M.Fault tree analysis:A survey of the state-of-the-art in modeling,analysis and tools[J].Computer Science Review,2015,15-16(3):29-62.
[5] FU G Z,HUANG Z H,LI H Q,et al.Fault tree analysis on kinematic accuracy of wafer stage using BDD and DFTA technique[C]∥2013 International Conference on Quality,Reliability,Risk,Maintenance,and Safety Engineering (QR2MSE).IEEE,2013:260-262.
[6] GE D,LI D,CHOU Q,et al.Quantification of highly coupled dynamic fault tree using IRVPM and SBDD[J].Quality and Reliability Engineering International,2016,2(1):139-151.
[7] ZHU P,HAN J,LIU L,et al.A stochastic approach for the analysis of fault trees with priority AND gates[J].IEEE Tran-sactions on Reliability,2014,63(2):480-494.
[8] LIU H.On variable ordering heuristics of BDD-based fault tree analysis[D].Hangzhou:Zhejiang Normal University,2012.(in Chinese) 刘华.基于BDD故障树分析的启发式变量排序研究[D].杭州:浙江师范大学,2012.
[9] SUN Y,DU S G.A Novel Ordering Method of Binary Decision Diagram [J].Journal of Systems and Management,2008(2):210-216,220.(in Chinese) 孙艳,杜素果.一种二元决策图底事件排序的新方法[J].系统管理报,2008(2):210-216,220.
[10] DUAN S,ZHANG X R,LIU S K,et al.Transformation methodof fault tree based on BDD[J].Computer Engineering and Application,2009,5(21):51-54.(in Chinese) 段珊,张修如,刘树锟,等.一种故障树向BDD的转化方法[J].计算机工程与应用,2009,45(21):51-54.
[11] GAO S C.Methods and Implementation of Dynamic Fault Tree Analysis[D].Changsha:National University of Defense Tech-nolog,2005.(in Chinese) 高顺川.动态故障树分析方法及其实现[D].长沙:国防科学技术大学,2005.
[12] MO Y C,YANG Q S.Random generation and variable ordering of fault tree[J].Journal of Zhejiang University(Engineering Scien-ce),2011,45(9):1539-1543.(in Chinese) 莫毓昌,杨全胜.故障树随机生成及变量排序[J].浙江大学学报(工学版),2011,5(9):1539-1543.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!