A new approach for the verification of infinite-step and K-step opacity using two-way observers
From MaRDI portal
Publication:2407182
Recommendations
- Infinite-step opacity and K-step opacity of stochastic discrete-event systems
- Verification and enforcement of strong infinite- and k-step opacity using state recognizers
- Verifying weak and strong \(k\)-step opacity in discrete-event systems
- Comments on: ``A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
- Verification of K-step and infinite-step opacity of bounded labeled Petri nets
Cites work
- A Uniform Approach for Synthesizing Property-Enforcing Supervisors for Partially-Observed Discrete-Event Systems
- Comparative analysis of related notions of opacity in centralized and coordinated architectures
- Concurrent secrets
- Current-State Opacity Formulations in Probabilistic Finite Automata
- Enforcing opacity of regular predicates on modal transition systems
- scientific article; zbMATH DE number 4160608 (Why is no real title available?)
- Introduction to Discrete Event Systems
- Modelling opacity using Petri nets
- Opacity of discrete event systems and its applications
- Opacity-Enforcing Supervisory Strategies via State Estimator Constructions
- Probabilistic opacity for Markov decision processes
- Supervisory Control for Opacity
- Synthesis of insertion functions for enforcement of opacity security properties
- Synthesis of opaque systems with static and dynamic masks
- Verification of Infinite-Step Opacity and Complexity Considerations
- Verification of initial-state opacity in security applications of discrete event systems
- Verification of opacity and diagnosability for pushdown systems
Cited in
(32)- 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
- Verification and enforcement of strong infinite- and k-step opacity using state recognizers
- 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
- Comments on: ``A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
- Authors' reply to ``Comments on: ``A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers'
- An improved approach for verifying delayed detectability of discrete-event systems
- Initial-state detectability and initial-state opacity of unambiguous weighted automata
- A general language-based framework for specifying and verifying notions of opacity
- Strong current-state and initial-state opacity of discrete-event systems
- Relative predictability of failure event occurrences and its opacity-based test algorithm
- Current-state opacity and initial-state opacity of modular discrete event systems
- 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
- Enforcing opacity by insertion functions under multiple energy constraints
- 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
- New insights into opacity verification in timed discrete-event systems
- Verification of current-state opacity and opaque time for labeled time Petri net systems
- Always guarding you: strong initial-and-final-state opacity of discrete-event systems
- Verification and transformation for a trajectory-based weak K-step opacity
- Verification and enforcement of strong state-based opacity for discrete-event systems
- \(k\)-memory-embedded insertion mechanism for opacity enforcement
This page was built for publication: A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407182)
