Showing 2025Show all
2 papers · 1 filter
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.FL2025
On the Secret Protection Problem in Discrete-Event Systems
Tomáš Masopust, Jakub Večeřa
The secret protection problem (SPP) seeks to synthesize a minimum-cost policy ensuring that every execution from an initial state to a secret state includes a sufficient number of…