Using subobservers to synthesize opacity-enforcing supervisors
From MaRDI portal
Publication:2106417
Abstract: In discrete-event system control, the worst-case time complexity for computing a system's observer is exponential in the number of that system's states. This results in practical difficulties since some problems require calculating multiple observers for a changing system, e.g., synthesizing an opacity-enforcing supervisor. Although calculating these observers in an iterative manner allows us to synthesize an opacity-enforcing supervisor and although methods have been proposed to reduce the computational demands, room exists for a practical and intuitive solution. Here we extend the subautomaton relationship to the notion of a subobserver and demonstrate its use in reducing the computations required for iterated observer calculations. We then demonstrate the subobserver relationship's power by simplifying state-of-the-art synthesis approaches for opacity-enforcing supervisors under realistic assumptions.
Recommendations
- Current-state opacity enforcement in discrete event systems under incomparable observations
- A novel approach for supervisor synthesis to enforce opacity of discrete event systems
- Dynamic Observers for the Synthesis of Opaque Systems
- On the computation of observers in discrete-event systems
- Comments on: ``A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- 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 enforcement in discrete event systems under incomparable observations
- Decentralized supervisory control of discrete-event systems
- Introduction to Discrete Event Systems
- Limited lookahead policies in supervisory control of discrete event systems
- Near-optimal online control of dynamic discrete-event systems
- On observability of discrete-event systems
- On properties and state complexity of deterministic state-partition automata
- Opacity of discrete event systems and its applications
- Opacity-Enforcing Supervisory Strategies via State Estimator Constructions
- Supervisory Control for Opacity
- Supervisory Control of a Class of Discrete Event Processes
- Supervisory control of discrete-event systems
- Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
This page was built for publication: Using subobservers to synthesize opacity-enforcing supervisors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106417)