On verification of D-detectability for discrete event systems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F21%3A73607925" target="_blank" >RIV/61989592:15310/21:73607925 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0005109821004064" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0005109821004064</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.automatica.2021.109884" target="_blank" >10.1016/j.automatica.2021.109884</a>

Result language
angličtina
Original language name
On verification of D-detectability for discrete event systems
Original language description
Detectability is a state-estimation property asking whether the current and subsequent states of a system can be determined based on observations. To exactly determine the current and subsequent states may be, however, too strict in some applications. Therefore, Shu and Lin relaxed detectability to D-detectability distinguishing only certain pairs of states rather than all states. Four variants of D-detectability were defined: strong (periodic) D-detectability and weak (periodic) D-detectability. Deciding weak (periodic) D-detectability is PSPACE-complete, while deciding strong (periodic) detectability or strong D-detectability is polynomial, and we show that it is NL-complete. To the best of our knowledge, it is an open problem whether there exists a polynomial-time algorithm deciding strong periodic D-detectability. We show that deciding strong periodic D-detectability is a PSPACE-complete problem, which means that there is no polynomial-time algorithm, unless every problem solvable in polynomial space can be solved in polynomial time. We further show that there is no polynomial-time algorithm even for systems with a single observable event, unless P = NP. Finally, we propose a class of systems for which the problem is tractable.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/LTAUSA19098" target="_blank" >LTAUSA19098: Verification and Control of Networked Discrete-Event Systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

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

Similar results(10)