Compositional synthesis of opacity-preserving finite abstractions for interconnected systems
From MaRDI portal
Publication:2665387
Abstract: In this paper, we propose a compositional approach to construct opacity-preserving finite abstractions (a.k.a symbolic models) for networks of discrete-time nonlinear control systems. Particularly, we introduce new notions of simulation functions that characterize the distance between control systems while preserving opacity properties across them. Instead of treating large-scale systems in a monolithic manner, we develop a compositional scheme to construct the interconnected finite abstractions together with the overall opacity-preserving simulation functions. For a network of incrementally input-to-state stable control systems and under some small-gain type condition, an algorithm for designing local quantization parameters is presented to orderly build the local symbolic models of subsystems such that the network of symbolic models simulates the original network for an a-priori defined accuracy while preserving its opacity properties.
Recommendations
- Compositional synthesis of finite abstractions for networks of systems: a small-gain approach
- Verification of approximate opacity for switched systems: a compositional approach
- Compositional Construction of Approximate Abstractions of Interconnected Control Systems
- Compositional abstraction refinement for control synthesis
- Compositional abstraction for stochastic systems
- scientific article; zbMATH DE number 1670557
- Compositional (In)Finite Abstractions for Large-Scale Interconnected Stochastic Systems
- Compositional Synthesis of Finite-State Abstractions
- scientific article; zbMATH DE number 2085342
Cites work
- A Lyapunov approach to incremental stability properties
- Approximation Metrics for Discrete and Continuous Systems
- Bisimilar Finite Abstractions of Interconnected Systems
- Compositional synthesis of finite abstractions for networks of systems: a small-gain approach
- Compositional Synthesis of Finite-State Abstractions
- Constructing control system abstractions from modular components
- Current-State Opacity Formulations in Probabilistic Finite Automata
- Decidability of opacity verification problems in labeled Petri net systems
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Notions of Centralized and Decentralized Opacity in Linear Systems
- On Approximate Opacity of Cyber-Physical Systems
- Opacity of discrete event systems and its applications
- Opacity of Nondeterministic Transition Systems: A (Bi)Simulation Relation Approach
- Small gain theorems for large scale systems and construction of ISS Lyapunov functions
- Symbolic Models for Networks of Control Systems
- Verification of Infinite-Step Opacity and Complexity Considerations
- Verification of initial-state opacity in security applications of discrete event systems
Cited in
(6)- Verification of approximate opacity for switched systems: a compositional approach
- Compositional synthesis of finite abstractions for networks of systems: a small-gain approach
- Dynamic Observers for the Synthesis of Opaque Systems
- Current-state opacity and initial-state opacity of modular discrete event systems
- Compositional and Abstraction-Based Approach for Synthesis of Edit Functions for Opacity Enforcement
- scientific article; zbMATH DE number 5583830 (Why is no real title available?)
This page was built for publication: Compositional synthesis of opacity-preserving finite abstractions for interconnected systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2665387)
