Verifying weak and strong k-step opacity in discrete-event systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F23%3A73620757" target="_blank" >RIV/61989592:15310/23:73620757 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S0005109823003138" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0005109823003138</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.automatica.2023.111153" target="_blank" >10.1016/j.automatica.2023.111153</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Verifying weak and strong k-step opacity in discrete-event systems

Popis výsledku v původním jazyce

Opacity is an important system-theoretic property expressing whether a system may reveal its secret to a passive observer (an intruder) who knows the structure of the system but has only limited observations of its behavior. Several notions of opacity have been discussed in the literature, including current-state opacity, k-step opacity, and infinite-step opacity. We investigate weak and strong kstep opacity, the notions that generalize both current-state opacity and infinite-step opacity, and ask whether the intruder is not able to decide, at any time instant, when respectively whether the system was in a secret state during the last k observable steps. We design a new algorithm verifying weak k-step opacity, the complexity of which is lower than the complexity of existing algorithms and does not depend on the parameter k, and show how to use it to verify strong k-step opacity by reducing strong k-step opacity to weak k-step opacity. The complexity of the resulting algorithm is again better than the complexity of existing algorithms and does not depend on the parameter k.

Název v anglickém jazyce

Verifying weak and strong k-step opacity in discrete-event systems

Popis výsledku anglicky

Opacity is an important system-theoretic property expressing whether a system may reveal its secret to a passive observer (an intruder) who knows the structure of the system but has only limited observations of its behavior. Several notions of opacity have been discussed in the literature, including current-state opacity, k-step opacity, and infinite-step opacity. We investigate weak and strong kstep opacity, the notions that generalize both current-state opacity and infinite-step opacity, and ask whether the intruder is not able to decide, at any time instant, when respectively whether the system was in a secret state during the last k observable steps. We design a new algorithm verifying weak k-step opacity, the complexity of which is lower than the complexity of existing algorithms and does not depend on the parameter k, and show how to use it to verify strong k-step opacity by reducing strong k-step opacity to weak k-step opacity. The complexity of the resulting algorithm is again better than the complexity of existing algorithms and does not depend on the parameter k.

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

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2023

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

1873-2836

Svazek periodika

155

Číslo periodika v rámci svazku

SEP

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

12

Strana od-do

"111153-1"-"111153-12"

Kód UT WoS článku

001026237100001

EID výsledku v databázi Scopus

2-s2.0-85162198427