Referenced Items are not available for this document.
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.
Published in:
Reliability, IEEE Transactions on
(Volume:R-25
,
Issue:
2
)
Date of Publication: June 1976
- Page(s):
- 77 - 80
- ISSN :
- 0018-9529
- Digital Object Identifier :
- 10.1109/TR.1976.5214983
- Date of Current Version :
- 25 August 2009
- Issue Date :
- June 1976
- Sponsored by :
- IEEE Reliability Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
