eduzhai > Applied Sciences > Engineering >

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

  • Save

... pages left unread,continue reading

Document pages: 19 pages

Abstract: The security in information-flow has become a major concern forcyber-physical systems (CPSs). In this work, we focus on the analysis of aninformation-flow security property, called opacity. Opacity characterizes theplausible deniability of a system s secret in the presence of a maliciousoutside intruder. We propose a methodology of checking a notion of opacity,called approximate initial-state opacity, for networks of discrete-timeswitched systems. Our framework relies on compositional constructions of finiteabstractions for networks of switched systems and their so-called approximateinitial-state opacity-preserving simulation functions (InitSOPSFs). Thosefunctions characterize how close concrete networks and their finiteabstractions are in terms of the satisfaction of approximate initial-stateopacity. We show that such InitSOPSFs can be obtained compositionally byassuming some small-gain type conditions and composing so-called localInitSOPSFs constructed for each subsystem separately. Additionally, assumingcertain stability property of switched systems, we also provide a technique onconstructing their finite abstractions together with the corresponding localInitSOPSFs. Finally, we illustrate the effectiveness of our results through anexample.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×