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

@article{Liu2020VerificationOI,
  title={Verification of Initial-State Opacity for Switched Systems: A Compositional Approach},
  author={Siyuan Liu and Abdalla Swikir and Majid Zamani},
  journal={ArXiv},
  year={2020},
  volume={abs/2006.16661}
}

Figures from this paper

Compositional Verification of Initial-State Opacity for Switched Systems
TLDR
This work proposes a compositional framework for the verification of approximate initial-state opacity for networks of discrete-time switched systems and shows that such InitSOPSFs can be obtained compositionally by assuming some small-gain type conditions and composing so-called local InitSopSFs constructed for each subsystem separately.
Secure-by-Construction Synthesis of Cyber-Physical Systems

References

SHOWING 1-10 OF 39 REFERENCES
Compositional Verification of Initial-State Opacity for Switched Systems
TLDR
This work proposes a compositional framework for the verification of approximate initial-state opacity for networks of discrete-time switched systems and shows that such InitSOPSFs can be obtained compositionally by assuming some small-gain type conditions and composing so-called local InitSopSFs constructed for each subsystem separately.
On Approximate Opacity of Cyber-Physical Systems
TLDR
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.
Notions of security and opacity in discrete event systems
TLDR
It is shown that the state-based definition of opacity enables the use of observer constructions for verification purposes and the verification of (S,P, K)-opacity is accomplished via an observer with K-delay which is constructed to capture state estimates withK-delay.
Verification of Infinite-Step Opacity and Complexity Considerations
TLDR
It is shown that infinite-step opacity can be verified via the construction of a set of appropriate initial state estimators and established that the verification of infinite- step opacity is a PSPACE-hard problem.
Verification of $K$-Step Opacity and Analysis of Its Complexity
TLDR
This work provides two methods for verifying K -step opacity using two different state estimator constructions, and analyzes the computational complexity of both.
Opacity of Nondeterministic Transition Systems: A (Bi)Simulation Relation Approach
TLDR
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.
Verification of K-step opacity and analysis of its complexity
  • A. Saboori, C. Hadjicostis
  • Mathematics
    Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference
  • 2009
TLDR
This paper analyzes the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on their transitions and establishes that the verification is NP-hard.
Compositional Synthesis of Finite-State Abstractions
TLDR
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.
...
...