All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Decentralized fault diagnosis for constant-time automata

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Decentralized fault diagnosis for constant-time automata

  • Original language description

    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.

  • 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

    10101 - Pure mathematics

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2024

  • 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 Control Systems Letters

  • ISSN

    2475-1456

  • e-ISSN

  • Volume of the periodical

    8

  • Issue of the periodical within the volume

    December

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    6

  • Pages from-to

    3392-3397

  • UT code for WoS article

    001421978900006

  • EID of the result in the Scopus database

    2-s2.0-85217539624