Initial-and-final-state detectability of nondeterministic finite-state automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F24%3A00602329" target="_blank" >RIV/67985840:_____/24:00602329 - isvavai.cz</a>
Result on the web
<a href="https://ieeexplore.ieee.org/abstract/document/10665365" target="_blank" >https://ieeexplore.ieee.org/abstract/document/10665365</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Initial-and-final-state detectability of nondeterministic finite-state automata
Original language description
Detectability is a crucial notion regarding the state estimation problem of real-world systems. In this paper, we propose a new notion of detectability, namely initial-and-final-state detectability (IFD), which indicates the ability to determine the initial state, the current state, and subsequent states of a system. Similar to prior concepts of detectability, we categorize IFD into two variants known as weak initial-and-final-state detectability (WIFD) and strong initial-and-final-state detectability (SIFD). On the one hand, in the case of WIFD, we scrutinize its connection with two other detectability concepts: weak detectability and weak initial-state detectability. Similarly, in the context of SIFD, we explore its relationship with strong detectability and strong initial-state detectability. On the other hand, for a system modeled as a nondeterministic finite-state automaton, we present a method of constructing multiple I-labeled observers to verify its WIFD. We also demonstrate the feasibility of using a detector and a reversed verifier to verify SIFD for the system.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)