Corpus ID: 209376972

On Opacity Verification for Discrete-Event Systems

  title={On Opacity Verification for Discrete-Event Systems},
  author={Jivr'i Balun and T. Masopust},
  • Jivr'i Balun, T. Masopust
  • Published 2019
  • Computer Science, Engineering
  • ArXiv
  • Opacity is an information flow property characterizing whether a system reveals its secret to an intruder. Verification of opacity for discrete-event systems modeled by automata is in general a hard problem. We discuss the question whether there are structural restrictions on the system models for which the opacity verification is tractable. We consider two kinds of automata models: (i) acyclic automata, and (ii) automata where all cycles are only in the form of self-loops. In some sense, these… CONTINUE READING
    1 Citations
    A Framework for Current-State Opacity under Dynamic Information Release Mechanism
    • PDF


    Verification of $K$-Step Opacity and Analysis of Its Complexity
    • 67
    • PDF
    Comparative analysis of related notions of opacity in centralized and coordinated architectures
    • 92
    • Highly Influential
    • PDF
    Notions of security and opacity in discrete event systems
    • 132
    Opacity generalised to transition systems
    • 140
    • PDF
    Synthesis of opaque systems with static and dynamic masks
    • 87
    • Highly Influential
    • PDF
    Opacity of discrete event systems and its applications
    • Feng Lin
    • Mathematics, Computer Science
    • Autom.
    • 2011
    • 136
    • PDF
    Overview of discrete event systems opacity: Models, validation, and quantification
    • 90
    • PDF
    Modelling Opacity Using Petri Nets
    • 110
    • PDF
    Opacity enforcing control synthesis
    • 60
    • PDF
    Preserving Secrecy Under Refinement
    • 95
    • PDF