Abstract
Many real-world systems (such as cellular telephones, transportation, etc.) are Multi-state Node Networks (MNNs) that are composed of multi-state nodes with different states determined by a set of nodes receiving the signal directly from these nodes without satisfying the conservation law. Current methods for evaluating MNN reliability are all derived from Universal Generating Function Methods (UGFMs). Unfortunately, UGFMs are only effective for special MNNs without any cycle, i.e. acyclic MNNs. A very simple revised UGFM is developed for the general MNN reliability problem. The proposed UGFM allows cycles with the same time complexity as the best-known UGFM. The correctness and computational complexity of the proposed UGFM are analyzed and proven. One example is given to illustrate how MNN reliability is evaluated using the proposed UGFM.
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.
