| Summary: | 碩士 === 淡江大學 === 資訊工程研究所 === 70 ===
Conventionally, it usually requires two steps to find the tenminal reliability for a general network. First, construct the minimum path sets or minimum cut sets to find the system success or failure event S and then using probability or Boolean algebra, transform S to its equivalent diajoint S form.
In this thesis we proposed an algorithm to find the minimum path sets for any pair of nodes based on the idea of spanning trees. This algorithm is simplified when a fixed pair of nodes is given. We also proposed a concept of "path tree" to find terminal reliability directly. A short-cut is derived to obtain an approximate result. The minimum path sets, minimum cut sets and critical paths can also be found from the path tree. Furthermore, we proposed an algorithm to evaluate the network reliability, which is particularly efficient for n close to b, where n is total number of nodes and b is total number of edges in the network.
|
|---|
