Diagnosability of unambiguous max-plus automata

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F22%3A00562936" target="_blank" >RIV/67985840:_____/22:00562936 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1109/TSMC.2022.3176045" target="_blank" >https://doi.org/10.1109/TSMC.2022.3176045</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Diagnosability of unambiguous max-plus automata

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Diagnosability of unambiguous max-plus automata

Popis výsledku anglicky

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.

Druh

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

CEP obor

—

OECD FORD obor

20205 - Automation and control systems

Projekt

<a href="/cs/project/GC19-06175J" target="_blank" >GC19-06175J: Kompozitní metody pro řízení konkurentních časovaných diskrétních událostních systémů</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2022

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 Transactions on Systems Man Cybernetics-Systems

ISSN

2168-2216

e-ISSN

2168-2232

Svazek periodika

52

Číslo periodika v rámci svazku

11

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

10

Strana od-do

7302-7311

Kód UT WoS článku

000800807100001

EID výsledku v databázi Scopus

2-s2.0-85140292651