Abstract
A new method for reliability analysis of stochastic flow networks is proposed. Nodes as well as branches can have limited capacities and can fail. The method builds a branching tree. The tree-nodes are the disjoint terms of a symbolic reliability expression. The paper shows how to find the probability function and mean of the network performance. The method is both simple and effective. The minimal paths or cutsets are not needed explicitly. On a computer the memory effort is very low #x0005F; it increases only quadratically with the number of failing elements. The method can be modified reasonably for other reliability problems.
Sign-in/Register to access full text options 
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.
