Opacity of discrete event systems and its applications
From MaRDI portal
Publication:716123
DOI10.1016/J.AUTOMATICA.2011.01.002zbMath1216.93020OpenAlexW2052227055MaRDI QIDQ716123
Publication date: 19 April 2011
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2011.01.002
Application models in control theory (93C95) Discrete event control/observation systems (93C65) Observability (93B07)
Related Items (42)
Enforcement for infinite-step opacity and K-step opacity via insertion mechanism ⋮ A framework for current-state opacity under dynamic information release mechanism ⋮ \(k\)-memory-embedded insertion mechanism for opacity enforcement ⋮ Comparative analysis of related notions of opacity in centralized and coordinated architectures ⋮ Decidability of opacity verification problems in labeled Petri net systems ⋮ A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers ⋮ Compositional synthesis of opacity-preserving finite abstractions for interconnected systems ⋮ \(N\)-diagnosability for active on-line diagnosis in discrete event systems ⋮ A general language-based framework for specifying and verifying notions of opacity ⋮ Unnamed Item ⋮ Networked opacity for finite state machine with bounded communication delays ⋮ Verification and enforcement of current-state opacity based on a state space approach ⋮ Strong current-state and initial-state opacity of discrete-event systems ⋮ Secret inference and attacktability analysis of discrete event systems ⋮ State-based opacity of labeled real-time automata ⋮ Game current-state opacity formulation in probabilistic resource automata ⋮ Active opacity of discrete-event systems ⋮ Verifying weak and strong \(k\)-step opacity in discrete-event systems ⋮ Information control in networked discrete event systems and its application to battery management systems ⋮ Privacy and safety analysis of timed stochastic discrete event systems using Markovian trajectory-observers ⋮ On almost-sure intention deception planning that exploits imperfect observers ⋮ Enforcing opacity by insertion functions under multiple energy constraints ⋮ Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems ⋮ Synthesis of insertion functions for enforcement of opacity security properties ⋮ Trajectory detectability of discrete-event systems ⋮ Complexity of detectability, opacity and A-diagnosability for modular discrete event systems ⋮ Synthesis of sensor deception attacks at the supervisory layer of cyber-physical systems ⋮ Quantifying opacity ⋮ Current-state opacity enforcement in discrete event systems under incomparable observations ⋮ Detectability of networked discrete event systems ⋮ Enforcement of opacity by public and private insertion functions ⋮ Relative predictability of failure event occurrences and its opacity-based test algorithm ⋮ Analysis of strong and strong periodic detectability of bounded labeled Petri nets ⋮ Comparing the notions of opacity for discrete-event systems ⋮ Enhancement of opacity for distributed state estimation in cyber-physical systems ⋮ Enforcing current-state opacity through shuffle and deletions of event observations ⋮ Verification and enforcement of strong infinite- and \(k\)-step opacity using state recognizers ⋮ On verification of D-detectability for discrete event systems ⋮ Usability aware secret protection with minimum cost ⋮ Online verification of \(K\)-step opacity by Petri nets in centralized and decentralized structures ⋮ Using subobservers to synthesize opacity-enforcing supervisors ⋮ Enforcing opacity of regular predicates on modal transition systems
Cites Work
- Unnamed Item
- Formulas for calculating supremal controllable and normal sublanguages
- On observability of discrete-event systems
- Diagnosability of discrete event systems and its applications
- On-line control of partially observed discrete event systems
- Why event observation: Observability revisited
- Concurrent secrets
- State estimation and detectability of probabilistic discrete event systems
- Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation
- Safe diagnosability for fault-tolerant supervision of discrete-event systems
- Classical and Logic-Based Dynamic Observers for Finite Automata
- Observability of discrete event dynamic systems
- Preserving Secrecy Under Refinement
- Dynamic Observers for the Synthesis of Opaque Systems
- Supervisory Control of a Class of Discrete Event Processes
- Supervisory control of discrete-event processes with partial observations
- Active diagnosis of discrete-event systems
- Supervisory control of timed discrete-event systems under partial observation
- Diagnosability of discrete-event systems
- Fault diagnosis in discrete-event systems: Framework and model reduction
- Detectability of Discrete Event Systems
This page was built for publication: Opacity of discrete event systems and its applications
