How to Hand-Check a Symbolic Reliability Expression
- 1 December 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-32 (5) , 402-408
- https://doi.org/10.1109/tr.1983.5221710
Abstract
Checking symbolic reliability expressions is very useful for detecting faults in hand derivations and for debugging computer programs. This checking can be achieved in a systematic way, though it may be a formidable task. Three exhaustive tests are given. These tests apply to unreliability and reliability expressions for noncoherent as well as coherent systems, and to cases when both nodes and branches are unreliable, or when the system has a flow constraint. Further properties of reliability expressions derived through various methods are discussed. All the tests and other pertinent results are proved and illustrated by examples.Keywords
This publication has 16 references indexed in Scilit:
- Symbolic Reliability Analysis with the Aid of Variable-Entered Karnaugh MapsIEEE Transactions on Reliability, 1983
- A Cutset Approach to Reliability Evaluation in Communication NetworksIEEE Transactions on Reliability, 1982
- Comment on "Reliability Evaluation of a Flow NetworkIEEE Transactions on Reliability, 1982
- Modification of cutsets for reliability evaluation of communication systemsMicroelectronics Reliability, 1982
- Recursive Disjoint Products, Inclusion-Exclusion, and Min-Cut ApproximationsIEEE Transactions on Reliability, 1980
- Reliability Evaluation of a Flow NetworkIEEE Transactions on Reliability, 1980
- Bayesian Decomposition Method for Computing the Reliability of an Oriented NetworkIEEE Transactions on Reliability, 1976
- A New Algorithm for Symbolic System Reliability AnalysisIEEE Transactions on Reliability, 1976
- A Simple Method for Reliability Evaluation of a Communication SystemIEEE Transactions on Communications, 1975
- Reliability Analysis of Redundant Networks Using Flow GraphsIEEE Transactions on Reliability, 1970