Bayesian Decomposition Method for Computing the Reliability of an Oriented Network
- 1 June 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-25 (2) , 77-80
- https://doi.org/10.1109/tr.1976.5214983
Abstract
For a nonoriented network, Bayesian decomposition is straightforward and well known. A keystone element is assumed perfect (shorted), then failed (open) and the reliabilities of the two subnetworks are calculated. But for an oriented network, when the keystone element is assumed perfect, it cannot always be shorted (the 2 nodes brought together), because even a perfect element still retains its orientation. A technique for choosing keystone elements is proposed.Keywords
This publication has 4 references indexed in Scilit:
- A Boolean algebra method for computing the terminal reliability in a communication networkIEEE Transactions on Circuit Theory, 1973
- Reliability Analysis of Redundant Networks Using Flow GraphsIEEE Transactions on Reliability, 1970
- An Algorithm to Determine the Reliability of a Complex SystemIEEE Transactions on Reliability, 1969
- Analysis of Probabilistic NetworksIEEE Transactions on Communications, 1964