Online verification of \(K\)-step opacity by Petri nets in centralized and decentralized structures
From MaRDI portal
Publication:2081818
DOI10.1016/j.automatica.2022.110528zbMath1498.93461OpenAlexW4293125503WikidataQ113879455 ScholiaQ113879455MaRDI QIDQ2081818
Guanghui Zhu, Zhiwu Li, NaiQi Wu
Publication date: 30 September 2022
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2022.110528
Cites Work
- Unnamed Item
- Comparative analysis of related notions of opacity in centralized and coordinated architectures
- Synthesis of opaque systems with static and dynamic masks
- Verification of initial-state opacity in security applications of discrete event systems
- Opacity of discrete event systems and its applications
- A general architecture for decentralized supervisory control of discrete-event systems
- On-line verification of current-state opacity by Petri nets and integer linear programming
- Supervisory control synthesis of discrete-event systems using a coordination scheme
- Coordinated decentralized protocols for failure diagnosis of discrete event systems
- 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
- Synthesis of Optimal Insertion Functions for Opacity Enforcement
- The Complexity of Diagnosability and Opacity Verification for Petri Nets
- Opacity Enforcement Using Nondeterministic Publicly Known Edit Functions
- Verification of State-Based Opacity Using Petri Nets
- Opacity-Enforcing Supervisory Strategies via State Estimator Constructions
- Verification of Infinite-Step Opacity and Complexity Considerations
This page was built for publication: Online verification of \(K\)-step opacity by Petri nets in centralized and decentralized structures
