A New GO Methodology Algorithm Based On BDD
To solve the problems on quick achieving reliability and the minimal path sets (MPS) of a system with GO Methodology,a Binary Decision Diagram (BDD) based new GO methodology algorithm is introduced.This technique can avoid the shared signals and combination explosion problems simultaneously.Detailed steps with a case study are presented to explain the analysis procedure of this technique,firstly,establish the GO model and transform it into a directed acyclic diagram (DAG),logic tree and BDD successively; then minimize the BDD according to the Without Rule; at last,this system reliability and MPS can be achieved.The results of the studied case verify the validity and effectiveness of this algorithm.
Binary Decision Diagram GO methodology Minimize Reliability Minimal path sets
Jian FAN Yi REN Linlin LIU
School of reliability and system engineering, Beihang University, Beijing, China
国际会议
三亚
英文
466-471
2013-06-22（万方平台首次上网日期，不代表论文的发表时间）