Abstract
Diagnosability is an important characteristic indicator to determine whether the system is stable and reliable. In this paper, the general architecture of event-state-combination diagnosability is investigated. The contributions are threefold. First, the notion of event-state-combination diagnosability is formalized. Roughly speaking, an event-state-combination diagnosable system means that not only each combined fault can be detected, but also the system can determine whether it will work permanently in the failure states after the combined fault occurs. Then, an automaton with new information structure, called event-state-combination verifier, is constructed, which can be used for the verification of the event-state-combination diagnosability. Finally, the necessary and sufficient conditions for verifying whether the system is event-state-combination diagnosable is presented, that is, the event-state-combination verifier does not have any failure confused cycle.
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 callMore From: Journal of Ambient Intelligence and Humanized Computing
Disclaimer: 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.
