Polynomial-Time Verification of Decentralized Fault Pattern Diagnosability for Discrete-Event Systems

Polynomial-Time Verification of Decentralized Fault Pattern Diagnosability for Discrete-Event Systems

This paper considers the verification of decentralized fault pattern diagnosability for discrete event systems, where the pattern is modeled as a finite automaton whose accepted language is the objective to be diagnosed. We introduce a notion of codiagnosability to formalize the decentralized fault...

Full description

Bibliographic Details
Main Authors: Ye Liang, Gaiyun Liu, Ahmed M. El-Sherbeeny
Format: Article
Language:English
Published: MDPI AG 2023-09-01
Series:Mathematics
Subjects:
discrete event system
decentralized diagnosis
fault pattern
codiagnosability
computational complexity
Online Access:https://www.mdpi.com/2227-7390/11/18/3998

Internet

https://www.mdpi.com/2227-7390/11/18/3998

Similar Items