On verification of weak and strong k-step opacity for discrete-event systems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F22%3A00564912" target="_blank" >RIV/67985840:_____/22:00564912 - isvavai.cz</a>
Alternative codes found
RIV/61989592:15310/22:73614732
Result on the web
<a href="https://doi.org/10.1016/j.ifacol.2022.10.331" target="_blank" >https://doi.org/10.1016/j.ifacol.2022.10.331</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ifacol.2022.10.331" target="_blank" >10.1016/j.ifacol.2022.10.331</a>

Result language
angličtina
Original language name
On verification of weak and strong k-step opacity for discrete-event systems
Original language description
Opacity is an important property asking whether a passive observer (an intruder), who knows the structure of the system but has only a limited observation of its behavior, may reveal the secret of the system. Several notions of opacity have been studied in the literature, including current-state opacity, k-step opacity, and infinite-step opacity. We investigate weak and strong k-step 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 instant, when respectively whether the system was in a secret state during the last k observable steps. We design a new algorithm to verify weak k-step opacity, the complexity of which is lower than that of existing algorithms and that does not depend on the parameter k. Then, we show how to use this algorithm to verify strong k-step opacity by reducing the verification of strong k-step opacity to the verification of weak k-step opacity. The complexity of the resulting approach is again better than that of existing algorithms, and does not depend on the parameter k.nn
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Article name in the collection
IFAC-PapersOnLine. Volume 55, Issue 28 - Proceedings of 16th IFAC Workshop on Discrete Event Systems WODES 2022
ISBN
—
ISSN
2405-8963
e-ISSN
—
Number of pages
6
Pages from-to
108-113
Publisher name
Elsevier
Place of publication
Amsterdam
Event location
Prague
Event date
Sep 7, 2022
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000877003700016

Similar results(10)