Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems
From MaRDI portal
Publication:1716666
DOI10.1016/j.automatica.2018.10.049zbMath1406.93207MaRDI QIDQ1716666
Xiang Yin, Zhaojian Li, Weilin Wang, Shao-Yuan Li
Publication date: 5 February 2019
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2018.10.049
93C65: Discrete event control/observation systems
93B07: Observability
94C05: Analytic circuit theory
93E03: Stochastic systems in control theory (general)
Related Items
Performance safety enforcement in strongly connected timed event graphs, Opacity of networked discrete event systems, Enforcing current-state opacity through shuffle and deletions of event observations, Enforcement for infinite-step opacity and K-step opacity via insertion mechanism, A framework for current-state opacity under dynamic information release mechanism, Initial-state detectability and initial-state opacity of unambiguous weighted automata, Performance safety enforcement in stochastic event graphs against boost and slow attacks
Uses Software
Cites Work
- 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
- Verification of initial-state opacity in security applications of discrete event systems
- Opacity of discrete event systems and its applications
- Enforcement and validation (at runtime) of various notions of opacity
- Detectability in stochastic discrete event systems
- Verification of detectability in probabilistic finite automata
- Enforcing opacity of regular predicates on modal transition systems
- Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
- Decidability of opacity verification problems in labeled Petri net systems
- Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures
- A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
- 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
- Markov Chains
- Supervisory Control for Opacity
- Verification of Infinite-Step Opacity and Complexity Considerations
- Quantifying opacity
