Edge expansion diagram ( EED) and boundary set ( BS) methods had various constraints leading to problems in accuracy of reliability and space efficiency to build BDD model for the network with imperfect nodes.To overcome these problems , a new BDD-based algorithm called OBDD-DS was proposed for K-termi-nal network reliability analysis considering both edge and node failures .The proposed method had no restric-tions on the starting node for the compact BDD model construction .In addition , based on a newly-defined con-cepts "dependency set", the proposed methods could accurately compute the reliability of networks with im-perfect nodes relying on identifying sub network correctly .Comprehensive examples and experiments in wide variations of networks were provided to show correctness and effectiveness of the proposed approach .%针对边扩展图EED方法和边界集BS方法存在的存储空间浪费和可靠度结果精度不高等缺陷,提出了一种基于依赖集的分析方法,解决了节点和边随机失效的网络可靠性问题.新方法不再受排序起点约束,可以灵活选择高质量排序以获得紧凑的BDD模型;同时,基于依赖集的分区能正确表征网络特征以获得精确解.综合实例和大量实验表明,所提出的方法是正确和高效的.
展开▼
