本文提出一種稱爲HHL90的演算法則，得用SDP方法來分析網路系統的可靠度，HHL90的主要特色是將路徑集的排列順序作最合適的安排並採用多變數互補方式，自從Abraham演算法則首先將網路可靠度函數，以較少項數的SDP型式表示後，陸續有許多文獻在SDP項數的縮減上探討，本文所提出的HHL90演算法則可得到比目前已發表之任何文獻，産生更少項數的SDP型式，而且因爲網路可靠度函數的項數已被大量縮減，故在計算時間及計算過程上均有極佳的改善。
This paper presents a new method, the HHL 90 algorithm, for calculating the network system reliability by sum of disjoint products (sdp). The main feature of the HHL 90 is its ability to properly arrange the order of minimal paths as well as to apply inversion to products of several variables. While the Abraham algorithm and its successors yield relatively short sdp forms of the structure functions of coherent network systems, this new method generates shorter disjoint products than any other known sdp method. Because the system reliability formula is considerably reduced in size, there will be a sharp decrease both in computation tine and in rounding errors.
