On verification of D-detectability for discrete event systems

Kód výsledku v 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>

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

On verification of D-detectability for discrete event systems

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

On verification of D-detectability for discrete event systems

Popis výsledku anglicky

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.

Druh

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

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/LTAUSA19098" target="_blank" >LTAUSA19098: Verifikace a řízení síťových diskrétních systémů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2021

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

AUTOMATICA

ISSN

0005-1098

e-ISSN

—

Svazek periodika

133

Číslo periodika v rámci svazku

NOV

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

10

Strana od-do

"109884-1"-"109884-10"

Kód UT WoS článku

000709307100002

EID výsledku v databázi Scopus

2-s2.0-85113281628