Paper

{
  "raw_xml": "<entry>\n    <id>http://arxiv.org/abs/2602.22713v1</id>\n    <title>Opacity in Discrete Event Systems: A Perspective and Overview</title>\n    <updated>2026-02-26T07:40:51Z</updated>\n    <link href='https://arxiv.org/abs/2602.22713v1' rel='alternate' type='text/html'/>\n    <link href='https://arxiv.org/pdf/2602.22713v1' rel='related' title='pdf' type='application/pdf'/>\n    <summary>Opacity has emerged as a central confidentiality notion for information-flow security in discrete event systems (DES), capturing the requirement that an external observer (intruder) should never be able to determine with certainty whether the system is, was, or will be in a secret state. This article provides a concise, newcomer-friendly overview of opacity in DES, emphasizing core definitions and the unifying estimation viewpoint behind major opacity notions,. We summarize representative verification techniques and highlight how different observation models reshape both the problem formulation and algorithmic structure. We then review principal enforcement paradigms, ranging from opacity-enforcing supervisory control to sensor activation/information release optimization and obfuscation/editing mechanisms. Beyond finite automata, we outline how opacity has been studied in richer models such as stochastic systems, timed systems, Petri nets, and continuous/hybrid dynamics, and we briefly survey applications in robotics, location privacy, and information services. Finally, we discuss selected open challenges, including solvability under incomparable information, scalable methods beyond worst-case complexity, and opacity under intelligent or data-driven adversaries.</summary>\n    <category scheme='http://arxiv.org/schemas/atom' term='eess.SY'/>\n    <category scheme='http://arxiv.org/schemas/atom' term='cs.FL'/>\n    <published>2026-02-26T07:40:51Z</published>\n    <arxiv:primary_category term='eess.SY'/>\n    <author>\n      <name>Xiang Yin</name>\n    </author>\n  </entry>"
}