Abstract
In this paper a method is proposed for the enumeration of all the k-trees in a network, and a new algorithm is introduced which uses the k-trees for evaluating the k% reliability, i.e. the probability that at least k% of the network nodes are connected. This reliability measure is more general and gives the well known overall reliability as a special case. The proposed method evaluates this measure using the concepts of Petri nets.
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.
