Abstract

The problem of fault diagnosis has become an active research topic in Discrete Event Systems, which can be applied into many different areas, such as communication networks, process control, flexible manufacturing systems, software engineering, etc. This brief explores the effect of communication delays on the event-based fault diagnosis in networked discrete event systems (NDESs), which can be modeled by finite state automata. Firstly, the framework of NDESs is introduced, and a novel concept of networked diagnosability ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$Net$ </tex-math></inline-formula> -diagnosability) is formally defined. Subsequently, the necessary and sufficient conditions for the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$Net$ </tex-math></inline-formula> -diagnosability in the partially observable outputs are provided, and the corresponding <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$Net$ </tex-math></inline-formula> -diagnosability can be verified by an effective diagnoser, which can be obtained by a constructed algorithm. Finally, an illustrative example is given to demonstrate the proposed method. The current results about networked diagnosability will be conducive to maintain the information security in the actual cyber-physical systems.

Full Text
Published version (Free)

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 call