Visible Bisimulation Equivalence — A Unified Abstraction for Temporal Logic Verification

Lennartson, Bengt; Noori-Hosseini, Mona

doi:10.1016/j.ifacol.2018.06.332

Cited by 5 publications

(3 citation statements)

References 9 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%

“…In this work, shared events are required for synchronization of subsystems, while state labels are used to model security properties. Recently, Lennartson and Noori-Hosseini (2018) introduced an abstraction for transition systems including both event and state labels, called visible bisimulation. It is directly defined as an equivalence relation based on block stuttering transitions, and more specifically on the set of event-target-blocks…”

Section: Preliminariesmentioning

confidence: 99%

“…This abstraction, denoted A c , generally generates more efficient reductions compared to the visible bisimulation abstraction, here denoted A v . The reason is that only the nonblocking property is preserved by A c , while visible bisimulation, including divergence sensitivity, preserves temporal logics similar to CTL * (Lennartson and Noori-Hosseini, 2018).…”

Section: Extended Local Observersmentioning

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: Preliminariesmentioning

confidence: 99%

Section: Extended Local Observersmentioning

confidence: 99%

See 1 more Smart Citation