# Compositional Synthesis of Opacity-Preserving Finite Abstractions for Interconnected Systems

@article{Liu2021CompositionalSO, title={Compositional Synthesis of Opacity-Preserving Finite Abstractions for Interconnected Systems}, author={Siyuan Liu and Majid Zamani}, journal={Autom.}, year={2021}, volume={131}, pages={109745} }

## 5 Citations

Verification of Initial-State Opacity for Switched Systems: A Compositional Approach

- Computer Science, MathematicsArXiv
- 2020

Current-state opacity and initial-state opacity of modular discrete event systems

- MathematicsInternational Journal of Control
- 2021

It is proved that the initial state estimator of modular system is isomorphic to the synchronous composition ofInitial state estimators for individual components, which offers the opportunity to reduce the complexity in verifying the opacity of modular DESs.

Opacity Enforcing Supervisory Control using Non-deterministic Supervisors

- Mathematics, Computer ScienceIFAC-PapersOnLine
- 2020

Secure-by-Construction Synthesis of Cyber-Physical Systems

- Computer ScienceAnnual Reviews in Control
- 2022

You Don't Know What I Know: On Notion of High-Order Opacity in Discrete-Event Systems

- Computer Science, MathematicsArXiv
- 2022

This paper says a system is high-order opaque if the intruder can never determine that the system user knows some information of importance based on its own incomparable information.

## References

SHOWING 1-10 OF 34 REFERENCES

Compositional Synthesis of Finite Abstractions for Networks of Systems: A Small-Gain Approach

- MathematicsAutom.
- 2019

On a Notion of Approximate Opacity for Discrete-Time Stochastic Control Systems*

- Mathematics, Computer Science2020 American Control Conference (ACC)
- 2020

A new notion of so-called opacity-preserving stochastic simulation functions is introduced to quantify the distance between two systems in a probabilistic setting, while preserving approximate initial-state opacity across them.

Compositional Synthesis of Finite-State Abstractions

- Computer ScienceIEEE Transactions on Automatic Control
- 2019

It is shown how networks of incrementally input-to-state stable, nonlinear, continuous-time control systems can be abstracted compositionally, so that all local abstractions are simultaneously disturbance bisimilar to their continuous counterparts.

Constructing Control System Abstractions from Modular Components

- Mathematics, Computer ScienceHSCC
- 2018

This paper introduces intermediate variables which break the interconnection and the abstraction procedure apart into smaller problems, and develops a theory of abstraction for discrete time nonlinear systems that are equipped with variables acting as interfaces for other systems.

Symbolic Control of Stochastic Systems via Approximately Bisimilar Finite Abstractions

- Computer Science, MathematicsIEEE Transactions on Automatic Control
- 2014

The technique enables automated, correct-by-construction, controller synthesis for stochastic control systems, which are common mathematical models employed in many safety critical systems subject to structured uncertainty.

Hierarchical control system design using approximate simulation

- Computer Science, MathematicsAutom.
- 2009

Opacity for switched linear systems: Notions and characterization

- Computer Science, Mathematics2017 IEEE 56th Annual Conference on Decision and Control (CDC)
- 2017

This work develops notions of opacity for discrete-time switched linear systems in terms of allowed switching sequences and sets of reachable states and/ or modes, and presents algorithms to verify these notions, and provides bounds on their computational complexity.

On Approximate Opacity of Cyber-Physical Systems

- Computer ScienceIEEE Transactions on Automatic Control
- 2021

A new simulation-type relation is proposed, called approximate opacity-preserving simulation relation, which characterizes how close two systems are in terms of the satisfaction of approximate opacity, which allows us to verify approximate opacity for large-scale, or even infinite, systems using their abstractions.

Opacity of Nondeterministic Transition Systems: A (Bi)Simulation Relation Approach

- Computer ScienceIEEE Transactions on Automatic Control
- 2019

Although the opacity verification problem for infinite NTSs is generally undecidable, if one can find such an opacity-preserving relation from an infinite NTS to a finite one, the (lack of) opacity of the infinite NTS can be easily verified over the finiteOne, which is decidable.

Notions of Centralized and Decentralized Opacity in Linear Systems

- Computer ScienceIEEE Transactions on Automatic Control
- 2020

The theory of opacity for single-adversary systems to the case of multiple adversaries and several notions of decentralized opacity are developed and extended.