Polynomial-time verification of safe diagnosability of discrete-event systems
LIU Fu-chun
LUO Ping
Abstract：Fault diagnosis of discrete event systems (DESs) is to detect the unobservable fault events occurring in systems within a finite delay, but the safety of the involved systems during the detection delay is always neglected. In order to solve this problem, this paper aims to propose an approach for safe diagnosability of DESs with a polynomial-time complexity. Firstly, the notion of safe diagnosability of DESs is formalized. Then the recognizer of illegal language is constructed to identify the sequences of the forbidden operations. Based on the recognizer, the safe verifier is constructed to perform the safe diagnosis for a given system. Furthermore, a necessary and sufficient condition of safe diagnosability of DESs is presented. It is worth noting that the safe diagnosability of DESs can be realized with a polynomial complexity by analyzing the complexity of constructing the verifier and the complexity of checking of the safe diagnosability of DESs.
Keywords：discrete event systemsfault diagnosissafe diagnosabilitypolynomial-time complexity
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：6( 717-722 )