Diagnosability of unambiguous max-plus automata

0562936 - MÚ 2023 RIV US eng J - Journal Article
Lai, A. - Komenda, Jan - Lahaye, S.
Diagnosability of unambiguous max-plus automata.
IEEE Transactions on Systems Man Cybernetics-Systems. Roč. 52, č. 11 (2022), s. 7302-7311. ISSN 2168-2216. E-ISSN 2168-2232
R&D Projects: GA ČR(CZ) GC19-06175J
Institutional support: RVO:67985840
Keywords : fault diagnosis * discrete-event systems * max-plus automata
OECD category: Automation and control systems
Impact factor: 8.7, year: 2022
Method of publishing: Limited access
https://doi.org/10.1109/TSMC.2022.3176045

This article investigates diagnosability and T-diagnosability for discrete-event systems modeled by unambiguous max-plus automata (UMPAs). More precisely, diagnosability requires that the occurrence of any fault can be detected within a finite number of events after the fault has occurred. T-diagnosability requires that the occurrence of any fault can be detected within a delay of at most T time units after its occurrence. First, we propose a polynomial-time algorithm based on the construction of a nondeterministic finite automaton over a weighted alphabet for diagnosability verification of a UMPA. Second, we prove that T-diagnosability of a UMPA can be studied by reducing it to the problem of diagnosability. Third, we introduce an approach to calculate the upper on the time needed for detecting fault occurrence for a diagnosable UMPA, and its complexity is of sixth order in the number of states of the UMPA.
Permanent Link: https://hdl.handle.net/11104/0335089