Verification of Infinite-Step Opacity and Complexity Considerations
From MaRDI portal
Cited in
(37)- Verification of detectability in probabilistic finite automata
- Verification complexity of a class of observational properties for modular discrete events systems
- Infinite-step opacity and K-step opacity of stochastic discrete-event systems
- Enforcement of opacity by public and private insertion functions
- Opacity of networked discrete event systems
- Verification of approximate opacity for switched systems: a compositional approach
- Comparing the notions of opacity for discrete-event systems
- Online verification of K-step opacity by Petri nets in centralized and decentralized structures
- Enforcement for infinite-step opacity and K-step opacity via insertion mechanism
- Verification of K-step and infinite-step opacity of bounded labeled Petri nets
- A framework for current-state opacity under dynamic information release mechanism
- Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
- Verification of opacity and diagnosability for pushdown 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
- A novel approach for supervisor synthesis to enforce opacity of discrete event systems
- Strong current-state and initial-state opacity of discrete-event systems
- Probabilistic opacity for Markov decision processes
- Relative predictability of failure event occurrences and its opacity-based test algorithm
- Current-state opacity and initial-state opacity of modular discrete event systems
- Verification and enforcement of current-state opacity based on a state space approach
- State-based opacity of labeled real-time automata
- Active opacity of discrete-event systems
- Matrix approach for verification of opacity of partially observed discrete event systems
- Verifying weak and strong \(k\)-step opacity in discrete-event systems
- Sensor deception attacks against security in supervisory control systems
- Quantifying opacity of discrete event systems modeled with probabilistic Petri nets
- Security and privacy with opacity-based state observation for finite state machine
- Opacity of discrete-event systems under nondeterministic observation mechanism
- Infinite- and K-step opacity verification of discrete-event systems under nondeterministic observations
- State estimation for constant-time labeled automata under dense time
- Obfuscation mechanism for simultaneous public event information release and private event information hiding in discrete event systems
- Always guarding you: strong initial-and-final-state opacity of discrete-event systems
- Verification and enforcement of strong state-based opacity for discrete-event systems
- \(k\)-memory-embedded insertion mechanism for opacity enforcement
- Enforcement and validation (at runtime) of various notions of opacity
- Detectability in stochastic discrete event systems
This page was built for publication: Verification of Infinite-Step Opacity and Complexity Considerations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5352820)
