Comparative analysis of related notions of opacity in centralized and coordinated architectures
From MaRDI portal
Publication:373013
DOI10.1007/S10626-012-0145-ZzbMATH Open1272.93084OpenAlexW2037457229MaRDI QIDQ373013FDOQ373013
Authors: Yi-Chin Wu, Stéphane Lafortune 
Publication date: 21 October 2013
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-012-0145-z
Recommendations
- Comparing the notions of opacity for discrete-event systems
- Opacity of discrete event systems and its applications
- Opacity of networked discrete event systems
- A general language-based framework for specifying and verifying notions of opacity
- Strong current-state and initial-state opacity of discrete-event systems
coordinated architecturecurrent-state opacityinitial-and-final-state opacityinitial-state opacitylanguage-based opacity
Communication networks in operations research (90B18) Discrete event control/observation systems (93C65)
Cites Work
- Introduction to Discrete Event Systems
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Diagnosability of discrete-event systems
- On observability of discrete-event systems
- Coordinated decentralized protocols for failure diagnosis of discrete event systems
- Concurrent secrets
- Modelling opacity using Petri nets
- Preserving Secrecy Under Refinement
- Dynamic Observers for the Synthesis of Opaque Systems
- Supervisory Control for Opacity
- CSP and anonymity
- Opacity of discrete event systems and its applications
Cited In (42)
- Current-state opacity modelling and verification in partially observed Petri nets
- Matrix approach for verification of opacity of partially observed discrete event systems
- Using subobservers to synthesize opacity-enforcing supervisors
- Opacity of networked discrete event systems
- Comparing the notions of opacity for discrete-event systems
- Relative predictability of failure event occurrences and its opacity-based test algorithm
- Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
- Opacity of discrete-event systems under nondeterministic observation mechanism
- Verification of C-detectability using Petri nets
- An optimization-based approach to assess non-interference in labeled and bounded Petri net systems
- A framework for current-state opacity under dynamic information release mechanism
- 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
- Strong current-state and initial-state opacity of discrete-event systems
- Assessment of initial-state-opacity in live and bounded labeled Petri net systems via optimization techniques
- Privacy and safety analysis of timed stochastic discrete event systems using Markovian trajectory-observers
- Infinite- and \(K\)-step opacity verification of discrete-event systems under nondeterministic observations
- Verification and enforcement of current-state opacity based on a state space approach
- A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
- Synthesis of insertion functions for enforcement of opacity security properties
- \(k\)-memory-embedded insertion mechanism for opacity enforcement
- Current-state opacity enforcement in discrete event systems under incomparable observations
- Opacity enforcement in discrete event systems using differential privacy
- On-line verification of current-state opacity by Petri nets and integer linear programming
- Current-state opacity and initial-state opacity of modular discrete event systems
- A general language-based framework for specifying and verifying notions of opacity
- Obfuscation mechanism for simultaneous public event information release and private event information hiding in discrete event systems
- Decidability of opacity verification problems in labeled Petri net systems
- Initial-state detectability and initial-state opacity of unambiguous weighted automata
- 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
- Probabilistic system opacity in discrete event systems
- Enforcement of opacity by public and private insertion functions
- Active opacity of discrete-event systems
- Online verification of \(K\)-step opacity by Petri nets in centralized and decentralized structures
- Information control in networked discrete event systems and its application to battery management systems
- Sensor deception attacks against security in supervisory control systems
- Optimization-based assessment of initial-state opacity in Petri nets
- State-based opacity of labeled real-time automata
- 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: Comparative analysis of related notions of opacity in centralized and coordinated architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q373013)
