Abstract
In the letter, two algorithms for fault identification in diagnosable systems are presented. The order of time complexity for worst-case analysis is given: while the first algorithm executes in a sequential fashion in 0(n), where n is the number of units in the system, the second algorithm executes in 0(log2 n) in a binary tree arrangement. The algorithms are applicable to a diagnostic model with no invalidation.
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.
