Compositional synthesis of opacity-preserving finite abstractions for interconnected systems
From MaRDI portal
Publication:2665387
DOI10.1016/j.automatica.2021.109745zbMath1478.93018arXiv2004.00131OpenAlexW3172768635MaRDI QIDQ2665387
Publication date: 19 November 2021
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.00131
Nonlinear systems in control theory (93C10) Discrete-time control/observation systems (93C55) Large-scale systems (93A15) Networked control (93B70)
Related Items (2)
Current-state opacity and initial-state opacity of modular discrete event systems ⋮ Verification of approximate opacity for switched systems: a compositional approach
Cites Work
- Unnamed Item
- Verification of initial-state opacity in security applications of discrete event systems
- Opacity of discrete event systems and its applications
- Compositional synthesis of finite abstractions for networks of systems: a small-gain approach
- Decidability of opacity verification problems in labeled Petri net systems
- Symbolic Models for Networks of Control Systems
- Current-State Opacity Formulations in Probabilistic Finite Automata
- Small Gain Theorems for Large Scale Systems and Construction of ISS Lyapunov Functions
- Bisimilar Finite Abstractions of Interconnected Systems
- Constructing Control System Abstractions from Modular Components
- On Approximate Opacity of Cyber-Physical Systems
- Notions of Centralized and Decentralized Opacity in Linear Systems
- Opacity of Nondeterministic Transition Systems: A (Bi)Simulation Relation Approach
- Compositional Synthesis of Finite-State Abstractions
- A Lyapunov approach to incremental stability properties
- Approximation Metrics for Discrete and Continuous Systems
- Verification of Infinite-Step Opacity and Complexity Considerations
This page was built for publication: Compositional synthesis of opacity-preserving finite abstractions for interconnected systems
