Verification of Diagnosability for Cyber-Physical Systems via Hybrid Barrier Certificates⁎

In this paper, we provide an automata-based framework for verifying diagnosability property of Cyber-Physical Systems leveraging a notion of so-called hybrid barrier certificates. Concretely, we first construct a so-called (δ,K)-deterministic finite automata ((δ,K)-DFA) associated with the desired diagnosability property, which captures the occurrence of the fault to be diagnosed. Having a (δ,K)-DFA, we show that the verification of diagnosability properties is equivalent to a safety verification problem over a product system between this DFA and the dynamical system of interest. We further show that such a verification problem can be solved via computing hybrid barrier certificates for the product system. To compute the hybrid barrier certificates, we provide a systematic technique leveraging a counter-example guided inductive synthesis framework. Finally, we showcase the effectiveness of our results through a case study.