3 papers
eess.SY2026
Complexity of Local Observation Consistency in Discrete-Event Systems
Tomáš Masopust
Hierarchical and multi-agent supervisory control under partial observation relies on local consistency conditions between a plant and its abstraction: local observation consistency…
cs.FL2025
Secret Protection in Labeled Petri Nets
Stefan Haar, Tomáš Masopust, Jakub VeÄeÅa
We study the secret protection problem (SPP), where the objective is to find a policy of minimal cost ensuring that every execution path from an initial state to a secret state con…
cs.FL2024
On Algorithms verifying Initial-and-Final-State Opacity: Complexity, Special Cases, and Comparison
Tomáš Masopust, Petr OsiÄka
Opacity is a general framework modeling security properties of systems interacting with a passive attacker. Initial-and-final-state opacity (IFO) generalizes the classical notions…