Back to Search
Start Over
Polynomial-Time Verification of Decentralized Fault Pattern Diagnosability for Discrete-Event Systems.
- Source :
- Mathematics (2227-7390); 9/15/2023, Vol. 11 Issue 18, p3998, 12p
- Publication Year :
- 2023
-
Abstract
- 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 pattern diagnosability, which requires the pattern to be detected by one of the external local observers within a bounded delay. To this end, a structure, namely a verifier, is proposed to verify the codiagnosability of the system and the fault pattern. By studying an indeterminate cycle of the verifier, sufficient and necessary conditions are provided to test the codiagnosability. It is shown that the proposed method requires polynomial time at most. In addition, we present an approach to extend the proposed verifier structure so that it can be applied to centralized cases. [ABSTRACT FROM AUTHOR]
- Subjects :
- DISCRETE systems
POLYNOMIAL time algorithms
Subjects
Details
- Language :
- English
- ISSN :
- 22277390
- Volume :
- 11
- Issue :
- 18
- Database :
- Complementary Index
- Journal :
- Mathematics (2227-7390)
- Publication Type :
- Academic Journal
- Accession number :
- 172436480
- Full Text :
- https://doi.org/10.3390/math11183998