scholarly journals Comparison of two new approaches to variable ordering for binary decision diagrams

2001 ◽  
Vol 17 (3) ◽  
pp. 151-158 ◽  
Author(s):  
L. M. Bartlett ◽  
J. D. Andrews
Keyword(s):  
Binary Decision Diagrams ◽  
Decision Diagrams ◽  
Binary Decision ◽  
New Approaches ◽  
Variable Ordering

A Variable Ordering Heuristic Based on Zero-Suppressed Binary Decision Diagrams

2010 ◽  
Author(s):  
Ya-zhou Li ◽  
Jin Wang ◽  
Li-qin Hu ◽  
Yi-can Wu
Keyword(s):  
Nuclear Power ◽  
Safety Assessment ◽  
Large Scale ◽  
Binary Decision Diagrams ◽  
Decision Diagrams ◽  
Binary Decision ◽  
Minimal Cut Sets ◽  
Variable Ordering ◽  
Safety And Reliability ◽  
Event Trees

Two approaches have been proposed to solve the large-scale fault trees or event trees for Probabilistic Safety Assessment in a nuclear power plant. The first one consists in MCS/ZBDD, which uses ZBDDs (Zero-suppressed Binary Decision Diagrams) to implement classical MCS (Minimal Cut Sets) algorithm. The second consists in designing heuristics and strategies to reduce the complexity of the BDDs (Binary Decision Diagrams) construction. This paper was motivated to combine the MCS/ZBDD and designing heuristics for ZBDDs together. A heuristic, which took the failure rate of basic event into account and utilized that truncation could be implemented on ZBDDs during the calculating process, was proposed. This heuristic accelerated the analysis progress by bringing forward the truncation and reducing the complexity of the intermediate ZBDDs. RiskA, a Zero-suppressed Binary Decision Diagram package extended to safety and reliability analysis, has adopted this heuristic. RiskA’s truncation strategies, which had some relations with the ordering scheme, were also introduced. The correctness and efficiency of this new heuristic were verified by some practical models’ analyses.

Sign in / Sign up

Export Citation Format

Share Document