On Transformations among Opacity Notions
On Transformations among Opacity Notions
On Transformations among Opacity Notions
Abstract
Abstract
pacity is a property asking whether a system may reveal its secret to a passive observer who knows the structure of the system but has only limited observations of its behavior. Several notions of opacity have been studied. Similarities among the opacity notions have been investigated via transformations, which have many potential applications. We investigate K-step opacity (K-SO), a notion that generalizes both current-state opacity and infinite-step opacity, and asks whether the intruder cannot decide, at any instant, whether or when the system was in a secret state during the last K observable steps. We provide new polynomial-time transformations among K-SO and other opacity notions. Our results lead, among others, to the general solution of an open problem concerning the computational complexity of the verification of K-SO.
Projects
Projects
Martin Trnečka
Jiří Balun, Jiří Valůšek
Verification and Control of Networked Discrete Event Systems
Verification and Control of Networked Discrete Event Systems
Tomáš Masopust, Jan Komenda
Jiří Balun, Stéphane Lafortune, Spyros Reveliotis, Feng Lin
Compositional Methods for the Control of Concurrent Timed Discrete-Event Systems
Compositional Methods for the Control of Concurrent Timed Discrete-Event Systems
Jan Komenda, Jörg Raisch
Tomáš Masopust, Thomas Moor
Links
Links
Authors
Authors
Jiří BalunTomáš Masopust
IEEE International Conference on Systems, Man, and Cybernetics (SMC), 3012-3017, 2022
Discrete-Event Systems and Theoretical Computer Science Research Group
DOI
Downloads
Downloads