Abstract
Checking a symbolic reliability expression for a flow network is 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 when a reliability system or network has a flow constraint. These tests apply to unreliability and reliability expressions for non-coherent as well as coherent systems, and to cases when both nodes and branches are unreliable. Further properties of reliability expressions derived through various methods are discussed. All the tests and other pertinent results are proved and illustrated by examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
