no code implementations • 4 Apr 2022 • Jiří Balun, Tomáš Masopust
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.
no code implementations • 2 Mar 2022 • Jan Komenda, Tomáš Masopust
Although observation consistency preserves normality between the levels for normal specifications, for specifications that are not normal, observation consistency is insufficient to guarantee that the supremal normal sublanguage computed on the low level and on the high level coincide.
no code implementations • 5 Sep 2021 • Jiří Balun, Tomáš Masopust
Opacity is a property expressing whether a system may reveal its secret to a passive observer (an intruder) who knows the structure of the system but has a limited observation of its behavior.
no code implementations • 4 Feb 2021 • Jiří Balun, Tomáš Masopust
We provide a complete and improved complexity picture of the verification of the discussed notions of opacity, and improve the algorithmic complexity of deciding language-based opacity, infinite-step opacity, and K-step opacity.
no code implementations • 16 Dec 2019 • Jan Komenda, Tomáš Masopust
The fundamental problem in hierarchical supervisory control under partial observation is to find conditions preserving observability between the original (low-level) and the abstracted (high-level) plants.
1 code implementation • 29 Mar 2018 • Liyong Lin, Tomáš Masopust, W. Murray Wonham, Rong Su
A (partial) solution to this problem is provided, which consists of 1) an incremental algorithm for the production of candidate reductions and 2) a reduction validation procedure.
Systems and Control Formal Languages and Automata Theory Optimization and Control
