Abstract
The failure event of a network can be expressed as the simultaneous failure of all the paths from source to terminal. This event can be expanded into disjoint events by using three simple lemmas to obtain the symbolic unreliability expression [2]. This paper first describes an algorithm, illustrated with a manual example, to derive the minimal paths between source and terminal. This is followed by the description of a computerised system which first derives all the minimal paths and then the unreliability expression using Ahmad-Jamil lemmas [2]. The results of the program execution on three different networks along with a discussion on the results are also presented.
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.
