Diagnosability of unambiguous max-plus automata
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Diagnosability of unambiguous max-plus automata
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
20205 - Automation and control systems
Result continuities
Project
<a href="/en/project/GC19-06175J" target="_blank" >GC19-06175J: Compositional Methods for the Control of Concurrent Timed Discrete-Event Systems</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE Transactions on Systems Man Cybernetics-Systems
ISSN
2168-2216
e-ISSN
2168-2232
Volume of the periodical
52
Issue of the periodical within the volume
11
Country of publishing house
US - UNITED STATES
Number of pages
10
Pages from-to
7302-7311
UT code for WoS article
000800807100001
EID of the result in the Scopus database
2-s2.0-85140292651