Answers are grounded in this paper and cite their sources.
Motivated by security and privacy considerations in a variety of applications of discrete event systems, we describe and analyze the computational complexity required for verifying the notion ofK-step opacity for systems that are modeled as nondeterministic finite automata with partial observation on their transitions. Specifically, a system isK-step opaque if, at any specific point within the lastKobservations, the entrance of the system state to a given set of secret states remains opaque (uncertain) to an intruder who has complete knowledge of the system model and observes system activity through some natural projection map. We provide two methods for verifyingK-step opacity using two different state estimator constructions, and analyze the computational complexity of both.
No takes yet. Share an insight, caveat, or question.
Saboori et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: