【摘要】 在BDD网络可靠性分析中,还没有一种可用的方法用来选择最佳(或高性能)的排序起点.为了找到最佳的排序起点,基于对BDD构建过程的深入分析,用实验总结的方法提出了一种"依赖集总长度小优先"的排序起点选择方法.在Square Lattice,De-Bruijn和Hyper Cube网络中的大量实验表明:所提方法能找到最佳(或高性能)排序起点,从而指导生成更小规模的BDD模型,提升网络可靠性分析性能.更多还原

【Abstract】 For there was no formal guidelines or methods available for choosing the optimal or high-performance root node of BDD-based network reliability analysis, from some insights into the BDD construction, it was presented a new root node selection method based on minimized total length of dependency set. With empirical studies in Square Lattice Network, De-Bruijn Network, and Hyper Cube Network, it was showed that the proposed method could give the optimal or high-performance root node which would contribute to slim BDD model.更多还原