Basic event ordering in fault tree analyses using binary decision diagram

Qinghua Daxue Xuebao/Journal of Tsinghua University

Volumn 45, Issue 12, 2005, Pages 1646-1649

  Min, Ping ^a   Tong, Jiejuan ^a   Xi, Shuren ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Binary decision diagram; Cut sets; Fault tree analysis; Optimal ordering

Indexed keywords

DECISION THEORY; NUCLEAR POWER PLANTS; PROBABILITY; TREES (MATHEMATICS);

BINARY DECISION DIAGRAM; CUT SETS; OPTIMAL ORDERING;

FAULT TREE ANALYSIS;

EID: 33344477734     PISSN: 10000054     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. ZHOU Faqing. Probability Safety Analysis of Nuclear Power Plant[M]. Shanghai: Shanghai Jiao Tong University Press, 1996. (in Chinese)
2. ZHU Jizhou. Nuclear Reactor Safety Analysis[M]. Xi'an: Xi'an Jiaotong University Press, 2000. (in Chinese)
3. Bryant R E. Graph-based algorithms for Boolean function manipulation[J]. IEEE Trans on Computers, 1986, C-35: 677-691.
4. Akers S B. Binary decision diagrams[J]. IEEE Trans on Computers, 1978. C-27: 509-516.
5. Sinnamon R M, Andrews J D. Fault tree analysis and binary decision diagrams[A]. Proc RAMS'96 Conf[C]. Las Vegas, Nevada, 1996. 215-222.
6. Bartlett L M, Andrews J D. An ordering heuristic to develop the binary decision diagram based on structural importance[J]. Reliability Eng and Syst Safety, 2001, 72: 31-38.