Abstract
The paper deals with the definition of procedure that enables one to determine, for a given plant, if all faults can be detected and located after a finite sequence of observable events. More formally, the diagnosability is the property that every fault can be correctly detected from the observable events of the system after its occurrence no later than a bounded number of events. In this paper, the diagnosability problem of Discrete Event Systems (DESs) is studied. As modeling tool, finite-state automaton in an event-based framework is used. A necessary and sufficient condition of diagnosability of such systems is proposed. The results proposed in this paper allow checking the diagnosability of discrete event systems in an efficient way, i.e. in polynomial time.
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: International Journal of Adaptive, Resilient and Autonomic Systems
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.
