Enforcement and validation (at runtime) of various notions of opacity
From MaRDI portal
Publication:896497
DOI10.1007/S10626-014-0196-4zbMATH Open1400.94143OpenAlexW1976202267MaRDI QIDQ896497FDOQ896497
Publication date: 9 December 2015
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00987985/file/main.pdf
Recommendations
- Verifying weak and strong \(k\)-step opacity in discrete-event systems
- Comparing the notions of opacity for discrete-event systems
- A general language-based framework for specifying and verifying notions of opacity
- Verification and enforcement of strong infinite- and \(k\)-step opacity using state recognizers
- Synthesis of insertion functions for enforcement of opacity security properties
Cites Work
- A brief account of runtime verification
- Title not available (Why is that?)
- Concurrent secrets
- Preserving Secrecy Under Refinement
- Dynamic Observers for the Synthesis of Opaque Systems
- Supervisory Control for Opacity
- Opacity-Enforcing Supervisory Strategies via State Estimator Constructions
- Verification of Infinite-Step Opacity and Complexity Considerations
- Enforcement and validation (at runtime) of various notions of opacity
- Runtime enforcement monitors: Composition, synthesis, and enforcement abilities
- Enforcing Non-safety Security Policies with Program Monitors
- Verification of initial-state opacity in security applications of discrete event systems
Cited In (23)
- Enforcing opacity by insertion functions under multiple energy constraints
- Matrix approach for verification of opacity of partially observed discrete event systems
- Opacity of discrete-event systems under nondeterministic observation mechanism
- A framework for current-state opacity under dynamic information release mechanism
- Strong current-state and initial-state opacity of discrete-event systems
- Infinite- and \(K\)-step opacity verification of discrete-event systems under nondeterministic observations
- Compositional and Abstraction-Based Approach for Synthesis of Edit Functions for Opacity Enforcement
- Synthesis of insertion functions for enforcement of opacity security properties
- Synthesis of obfuscation policies to ensure privacy and utility
- Opacity Enforcement via Attribute-Based Edit Functions in the Presence of an Intended Receiver
- Current-state opacity enforcement in discrete event systems under incomparable observations
- Enforcement and validation (at runtime) of various notions of opacity
- A novel approach for supervisor synthesis to enforce opacity of discrete event systems
- A general language-based framework for specifying and verifying notions of opacity
- Decidability of opacity verification problems in labeled Petri net systems
- Enhancement of opacity for distributed state estimation in cyber-physical systems
- Verification and enforcement of strong infinite- and \(k\)-step opacity using state recognizers
- Privacy-preserving co-synthesis against sensor-actuator eavesdropping intruder
- Enforcement of opacity by public and private insertion functions
- Active opacity of discrete-event systems
- Verifying weak and strong \(k\)-step opacity in discrete-event systems
- Game current-state opacity formulation in probabilistic resource automata
- Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems
Uses Software
This page was built for publication: Enforcement and validation (at runtime) of various notions of opacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896497)
