Abstract
In this paper, two complexity measures of large systems are proposed and a new algorithm based on the disjoint cut set method is presented to compute the complexity measures efficiency. Since the informational and diagnostic entropies reported in the literature do not reflect the structure of a system, an operational entropy (H/sub O/) and an inoperative entropy (H/sub I/) are proposed in this paper to measure the system complexity incorporating the system structure. In addition, an efficient calculational method is provided. The algorithm is exact since it involves no approximation, easy to understand, and computationally efficient.
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.
