Decentralized fault diagnosis for constant-time automata

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F24%3A00617047" target="_blank" >RIV/67985840:_____/24:00617047 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1109/LCSYS.2025.3538737" target="_blank" >https://doi.org/10.1109/LCSYS.2025.3538737</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/LCSYS.2025.3538737" target="_blank" >10.1109/LCSYS.2025.3538737</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Decentralized fault diagnosis for constant-time automata

Popis výsledku v původním jazyce

This letter investigates the verification problem of codiagnosability for discrete-event systems modeled by constant-time automata (CTAs). Codiagnosability requires that the occurrence of a fault event necessarily be detected by at least one local diagnostic agent within a finite number of events after the fault event occurs. In the present work, we first construct a verifier to check the codiagnosability of CTAs in the decentralized architecture. Additionally, an inappropriate, lower-complexity statement concerning diagnosability verification in our previous work is corrected. This correction prompts us to investigate the underlying reasons for increased complexity and to propose a condition for complexity reduction based on the verifier. Furthermore, another important contribution is our demonstration of the equivalence between diagnosability and codiagnosability for CTAs, an equivalence that does not hold in the framework of logical finite state automata. This equivalence serves as another verification technique for the codiagnosability of CTAs.

Název v anglickém jazyce

Decentralized fault diagnosis for constant-time automata

Popis výsledku anglicky

This letter investigates the verification problem of codiagnosability for discrete-event systems modeled by constant-time automata (CTAs). Codiagnosability requires that the occurrence of a fault event necessarily be detected by at least one local diagnostic agent within a finite number of events after the fault event occurs. In the present work, we first construct a verifier to check the codiagnosability of CTAs in the decentralized architecture. Additionally, an inappropriate, lower-complexity statement concerning diagnosability verification in our previous work is corrected. This correction prompts us to investigate the underlying reasons for increased complexity and to propose a condition for complexity reduction based on the verifier. Furthermore, another important contribution is our demonstration of the equivalence between diagnosability and codiagnosability for CTAs, an equivalence that does not hold in the framework of logical finite state automata. This equivalence serves as another verification technique for the codiagnosability of CTAs.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10101 - Pure mathematics

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2024

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

IEEE Control Systems Letters

ISSN

2475-1456

e-ISSN

—

Svazek periodika

8

Číslo periodika v rámci svazku

December

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

6

Strana od-do

3392-3397

Kód UT WoS článku

001421978900006

EID výsledku v databázi Scopus

2-s2.0-85217539624