Answers are grounded in this paper and cite their sources.
This article presents a procedure for <tex-math notation="LaTeX">K</tex-math>-step opacity verification and enforcement of timed observations generated from discrete event systems modeled by time labeled Petri nets. Within the framework of a timed discrete event system that is partially observed by an intruder, a <tex-math notation="LaTeX">K</tex-math>-step opaque timed observation means that an intruder has observed the system with time stamps but is not able to deduce the secret information within the knowledge derived from the last <tex-math notation="LaTeX">K</tex-math> steps of the timed observation. We propose an information structure called a partial modified state class graph with respect to a timed observation. Then, based on the particular graph, an algorithm is designed to construct a delayed marking estimator that is used for the verification of <tex-math notation="LaTeX">K</tex-math>-step opacity of a timed observation by solving a number of linear programming problems. Finally, when the timed observation is not <tex-math notation="LaTeX">K</tex-math>-step opaque, a strategy by adjusting the time horizons of transitions with soft time intervals is proposed for the opacity enforcement purpose.
No takes yet. Share an insight, caveat, or question.
Dong et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: