DocumentCode :
2483932
Title :
Complex fault tree analysis based on BDD route-based rules
Author :
Zhu, Lin ; Chen, Jie
Author_Institution :
Dept. of Autom. Control, Beijing Inst. of Technol., Beijing
fYear :
2008
fDate :
25-27 June 2008
Firstpage :
2766
Lastpage :
2770
Abstract :
Since traditional methods was limited in terms of accuracy of the solutions and the processing time required when dealing with large-scale complex fault tree (CFT), a new method for CFT analysis based on binary decision diagram (BDD) was introduced in this paper. Firstly, FT was decomposed by the proposed rule, share-node CBDD connection rules were proposed to reduce the size of the intermediate BDD. Furthermore route-based BDD reduction rule was proposed and proved, with which intermediate BDD was reduction. The route sequence and cut sets can be gotten at the same time of BDD composition for FT analysis. Processing time and computational & storage complexity is greatly reduced by the proposed method. Finally, with an example the procedure of the proposed method is presented. The affectivity and practicability is also proved.
Keywords :
binary decision diagrams; computational complexity; fault trees; large-scale systems; BDD route-based rules; binary decision diagram; complex fault tree analysis; storage complexity; Automation; Binary decision diagrams; Boolean functions; Data structures; Educational technology; Fault trees; Information analysis; Information science; Intelligent control; Laboratories; Binary Decision Diagram; Fault Tree; Reduction rules; cut set;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Control and Automation, 2008. WCICA 2008. 7th World Congress on
Conference_Location :
Chongqing
Print_ISBN :
978-1-4244-2113-8
Electronic_ISBN :
978-1-4244-2114-5
Type :
conf
DOI :
10.1109/WCICA.2008.4593363
Filename :
4593363
Link To Document :
بازگشت