Compositional Visible Bisimulation Abstraction Applied to Opacity Verification

Noori-Hosseini, Mona; Lennartson, Bengt; Hadjicostis, Christoforos N.

doi:10.1016/j.ifacol.2018.06.337

Cited by 20 publications

(13 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since this abstraction is based on strong bisimulation it has a minor reduction capability compared to abstractions where local events are hidden, such as weak bisimulation (Milner, 1989) and branching bisimulation (Van Glabbeek and Weijland, 1996). Recently the authors have proposed an abstraction method for current-state opacity verification of modular systems (Noori-Hosseini et al, 2018) based on a similar abstraction, called visible bisimulation equivalence (Lennartson and Noori-Hosseini, 2018). Both state labels and transition labels (events) are then integrated in the same abstraction method.…”

Section: Modularity and Abstractionmentioning

confidence: 99%

“…Both state labels and transition labels (events) are then integrated in the same abstraction method. This abstraction has the benefit that temporal logic properties are preserved in the abstraction, and the opacity verification in (Noori-Hosseini et al, 2018) is formulated as a temporal logic safety problem.…”

Section: Modularity and Abstractionmentioning

confidence: 99%

“…This incremental abstraction technique for modular systems can be traced back to (Graf et al, 1996), but its application to local events was more recently proposed in (Flordal and Malik, 2009), where it was called compositional verification. In (Noori-Hosseini et al, 2018) this incremental abstraction is adapted to opacity verification, and it shows great computational time improvement compared to standard methods.…”

Section: Modularity and Abstractionmentioning

confidence: 99%

See 2 more Smart Citations

Incremental Observer Reduction Applied to Opacity Verification and Synthesis

Noori-Hosseini¹,

Lennartson²,

Hadjicostis³

2018

Preprint

Self Cite

View full text Add to dashboard Cite

An incremental observer generation for modular systems is presented in this paper. It is applied to verification and enforcement of current-state opacity and current-state anonymity, both of which are security/privacy notions that have attracted attention recently. The complexity due to synchronization of subsystems, but also the exponential observer generation complexity, are tackled by local observer generation and an incremental abstraction. Observable events are hidden and abstracted step by step when they become local after synchronization with other subsystems. For systems with shared unobservable events, complete observers can not be generated before some local models are synchronized. At the same time, observable events should be abstracted when they become local, to avoid state space explosion. Therefore, a new combined incremental abstraction and observer generation is proposed. This requires some precaution (detailed in the paper) to be able to accomplish local abstractions before shared unobservable events are removed by observer generation. Furthermore, it is shown how current state opacity and anonymity can be enforced by a supervisor. This is achieved by a natural extension of the verification problem to a supervisory control problem based on forbidden states and incremental abstraction. Finally, a modular and scalable building security problem with arbitrary number of This work was partly carried out within the project SyTec -Systematic Testing of Cyber-Physical Systems, a Swedish Science Foundation grant for strong research environment. The support is gratefully acknowledged.

show abstract

Section: Modularity and Abstractionmentioning

confidence: 99%

Section: Modularity and Abstractionmentioning

confidence: 99%

Section: Modularity and Abstractionmentioning

confidence: 99%

See 1 more Smart Citation

Incremental Observer Reduction Applied to Opacity Verification and Synthesis

Noori-Hosseini¹,

Lennartson²,

Hadjicostis³

2018

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the context of DES, opacity has been studied very extensively in the past few years; see, e.g., some recent works [2], [5], [12], [13], [21], [25], [27], [30]- [33], [36], [42], [55] and the survey papers [18], [22]. Especially, to characterize different types of security requirements, different notions of opacity are proposed in the literature.…”

Section: Introductionmentioning

confidence: 99%

Optimal Synthesis of Opacity-Enforcing Supervisors for Qualitative and Quantitative Specifications

Xie¹,

Yin²,

Li³

2021

Preprint

View full text Add to dashboard Cite

In this paper, we investigate both qualitative and quantitative synthesis of optimal privacy-enforcing supervisors for partially-observed discrete-event systems. We consider a dynamic system whose information-flow is partially available to an intruder, which is modeled as a passive observer. We assume that the system has a "secret" that does not want to be revealed to the intruder. Our goal is to synthesize a supervisor that controls the system in a least-restrictive manner such that the closed-loop system meets the privacy requirement. For the qualitative case, we adopt the notion of infinite-step opacity as the privacy specification by requiring that the intruder can never determine for sure that the system is/was at a secret state for any specific instant. If the qualitative synthesis problem is not solvable or the synthesized solution is too restrictive, then we further investigate the quantitative synthesis problem so that the secret is revealed (if unavoidable) as late as possible. Effective algorithms are provided to solve both the qualitative and quantitative synthesis problems. Specifically, by building suitable information structures that involve information delays, we show that the optimal qualitative synthesis problem can be solved as a safety-game. The optimal quantitative synthesis problem can also be solved as an optimal total-cost control problem over an augmented information structure. Our work provides a complete solution to the standard infinite-step opacity control problem, which has not been solved without assumption on the relationship between controllable events and observable events. Furthermore, we generalize the opacity enforcement problem to the numerical setting by introducing the secret-revelation-time as a new quantitative measure.

show abstract

“…These data structures can be large, especially for distributed DESs with several local components. To mitigate this problem, many previous studies (e.g., [11], [12], [13]) investigated compositional opacity verification approaches. The approaches construct abstract structures of local DESs.…”

Section: Introductionmentioning

confidence: 99%

Local Opacity Verification for Distributed Discrete Event Systems

Pruekprasert¹,

Cai²

2021

Preprint

View full text Add to dashboard Cite

This paper studies current-state opacity and initial-state opacity verification of distributed discrete event systems. The distributed system's global model is the parallel composition of multiple local systems: each of which represents a component. We propose sufficient conditions for verifying opacity of the global system model based only on the opacity of the local systems. We also present efficient approaches for the opacity verification problem that only rely on the intruder's observer automata of the local DESs.

show abstract

Compositional Visible Bisimulation Abstraction Applied to Opacity Verification

Cited by 20 publications

References 13 publications

Incremental Observer Reduction Applied to Opacity Verification and Synthesis

Incremental Observer Reduction Applied to Opacity Verification and Synthesis

Optimal Synthesis of Opacity-Enforcing Supervisors for Qualitative and Quantitative Specifications

Local Opacity Verification for Distributed Discrete Event Systems

Contact Info

Product

Resources

About