A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
From MaRDI portal
Publication:2407182
DOI10.1016/j.automatica.2017.02.037zbMath1370.93174OpenAlexW2601738991MaRDI QIDQ2407182
Publication date: 28 September 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2017.02.037
Discrete event control/observation systems (93C65) Authentication, digital signatures and secret sharing (94A62)
Related Items (24)
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 ⋮ \(k\)-memory-embedded insertion mechanism for opacity enforcement ⋮ Current-state opacity and initial-state opacity of modular discrete event systems ⋮ 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 ⋮ 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 ⋮ Comments on: ``A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers ⋮ Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems ⋮ Enforcement of opacity by public and private insertion functions ⋮ Relative predictability of failure event occurrences and its opacity-based test algorithm ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Comparative analysis of related notions of opacity in centralized and coordinated architectures
- Synthesis of opaque systems with static and dynamic masks
- Probabilistic opacity for Markov decision processes
- Synthesis of insertion functions for enforcement of opacity security properties
- Verification of initial-state opacity in security applications of discrete event systems
- Opacity of discrete event systems and its applications
- Enforcing opacity of regular predicates on modal transition systems
- Verification of opacity and diagnosability for pushdown systems
- Concurrent secrets
- A Uniform Approach for Synthesizing Property-Enforcing Supervisors for Partially-Observed Discrete-Event Systems
- Current-State Opacity Formulations in Probabilistic Finite Automata
- Introduction to Discrete Event Systems
- Supervisory Control for Opacity
- Opacity-Enforcing Supervisory Strategies via State Estimator Constructions
- Verification of Infinite-Step Opacity and Complexity Considerations
This page was built for publication: A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
