Opacity in Discrete Event Systems: A Perspective and Overview

Researcher Xiang Yin has published a comprehensive survey paper titled 'Opacity in Discrete Event Systems: A Perspective and Overview' on arXiv (ID: 2602.22713), providing a unified framework for understanding information-flow security in automated systems. The paper consolidates over 20 years of research into opacity—a formal confidentiality property that ensures external intruders cannot determine with certainty whether a system is, was, or will be in a secret state. This work serves as both an introductory guide for newcomers and a technical reference for experts, emphasizing core definitions and the unifying estimation viewpoint behind major opacity notions while covering how different observation models reshape both problem formulation and algorithmic structure.

The paper systematically reviews principal enforcement paradigms ranging from opacity-enforcing supervisory control to sensor activation optimization and obfuscation mechanisms. Beyond finite automata, Yin outlines how opacity has been studied in richer models including stochastic systems, timed systems, Petri nets, and continuous/hybrid dynamics, with applications spanning robotics, location privacy, and information services. The survey concludes by identifying critical open challenges: solvability under incomparable information, scalable methods beyond worst-case complexity, and opacity under intelligent or data-driven adversaries—issues particularly relevant as AI systems become more integrated with physical infrastructure.