摘要

Fast composite-event probability algorithm with both linear time and space complexity is proposed. Based on the binary decision diagrams, the binary tree serves as the essential data structure in the presented algorithm, where the system adequacy index is obtained simply once if all the valid system states are known. The complexity of the presented algorithm depends linearly on the problem scale, which is endowed with a better performance than the classical inclusion-exclusion principle. A numerical example of IEEE RTS-24 test system confirms the validity.

  • 出版日期2008