On-line verification of initial-state opacity by Petri nets and integer linear programming

Cong, Xuya; Fanti, Maira Pia; Mangini, Agostino Marcello; Li, Zhiwu

doi:10.1016/j.isatra.2019.01.023

Cited by 22 publications

(9 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For state (5Y, {4Y, 5Y }, {0N, 1N, 2Y, 3Y, 4Y, 5Y }), when event a occurs, it reaches (7Y, {6Y, 7Y, 8N, 9N, 9Y }, {7Y }), where since a ∈ Σ o but 7Y / ∈ Xr , the third component is updated according to the second case of Equation ( 4 Theorem 2 Let Obs( G) be the DIRM-observer for system G. Then system G is current-state opaque w.r.t. X S and X r if and only if ∀x obs ∈ X obs : X 3 (x obs ) XS (13) We illustrate Theorem 2 by the following example. 3), where for x = (7Y, {6Y, 7Y, 8Y, 9Y, 9N }, {7Y }), we have X 3 (x) = {7Y } ⊆ XS .…”

Section: Inductionmentioning

confidence: 99%

A Framework for Current-State Opacity under Dynamic Information Release Mechanism

Hou¹,

Yin²,

Li³

2020

Preprint

View full text Add to dashboard Cite

Opacity is an important information-flow security property that characterizes the plausible deniability of a dynamic system for its "secret" against eavesdropping attacks. As an information-flow property, the underlying observation model is the key in the modeling and analysis of opacity. In this paper, we investigate the verification of current-state opacity for discrete-event systems under Orwellian-type observations, i.e., the system is allowed to re-interpret the observation of an event based on its future suffix. First, we propose a new Orwellian-type observation model called the dynamic information release mechanism (DIRM). In the DIRM, when to release previous "hold on" events is state-dependent. Then we propose a new definition of opacity based on the notion of history-equivalence rather than the standard projection-equivalence. This definition is more suitable for observations that are not prefix-closed. Finally, we show that by constructing a new structure called the DIRMobserver, current-state opacity can be effectively verified under the DIRM. Computational complexity analysis as well as illustrative examples for the proposed approach are also provided. Compared with the existing Orwellian-type observation model, the proposed framework is more general in the sense that the information-release-mechanism is state-dependent and the corresponding definition of opacity is more suitable for non-prefix-closed observations.

show abstract

Section: Inductionmentioning

confidence: 99%

A Framework for Current-State Opacity under Dynamic Information Release Mechanism

Hou¹,

Yin²,

Li³

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…Consequently, the authors resort to integer linear programming (ILP) to solve this problem. In the same context, online verification algorithms for current 38 and initial 39 state opacity have been proposed by Cong et al in LPNs by assuming the acyclicity of the observable and unobservable subnets. These algorithms detect the occurrence of events and decide whether the transition (event) sequence observed so far is opaque or not.…”

Section: Introductionmentioning

confidence: 99%

“…This decision is based on solving a group of ILPs. The works in 38 , 39 are restricted to secret markings defined by generalized mutual exclusion constraints (GMECs) 40 .…”

Section: Introductionmentioning

confidence: 99%

Current-state opacity verification in discrete event systems using an observer net

Labed

Saadaoui

et al. 2022

Sci Rep

Self Cite

View full text Add to dashboard Cite

Due to the proliferation of contemporary computer-integrated systems and communication networks, there is more concern than ever regarding privacy, given the potential for sensitive data exploitation. A recent cyber-security research trend is to focus on security principles and develop the foundations for designing safety-critical systems. In this work, we investigated the problem of verifying current-state opacity in discrete event systems using labeled Petri nets. A system is current-state opaque provided that the current-state estimate cannot be revealed as a subset of secret states. We introduced a new sub-model of the system, named an observer net. The observer net have the same structure as the plant, but it is distinguished by the use of colored markers as well as simultaneous and recursive transition enabling and firing, which offer an efficient state estimation. We considered two settings of the proposed approach: an on-line setting, in which a current-state opacity algorithm is proposed. The algorithm waits for the occurrence of an observable event and determines if the current observation of a plant reveals the secret behaviour, as well as, an off-line setting, where the verification problem is solved based on a state estimator called a colored estimator. In this context, necessary and sufficient conditions for verifying opacity are developed with illustrative examples to demonstrate the presented approach.

show abstract

“…Petri nets [3], as a major mathematical model, have been applied to many problems in discrete event systems [4]- [10], such as modeling and analysis [11], [52], control [12]- [17], opacity verification and enforcement [18], [19], scheduling [20]- [28], [50], [51], performance evaluation [29], [30], [53], fault identification and diagnosis [32], [33], [61], [62], validation of various properties [18], [19], [54], and deadlock analysis and control [31], [32], [34], [35], [45]- [48].…”

Section: Introductionmentioning

confidence: 99%

On Algebraic Identification of Critical States for Deadlock Control in Automated Manufacturing Systems Modeled With Petri Nets

et al. 2019

Self Cite

View full text Add to dashboard Cite

Petri nets are an important and popular tool to model and analyze deadlocks in automated manufacturing systems. The state space of a Petri net model can be divided into two disjoint parts: a live-zone and a dead-zone. A first-met bad marking (FBM) is a marking in the dead-zone, representing the very first entry from the live-zone to the dead-zone, and the calculation of FBMs to a large extent contributes to the complexity of designing optimal liveness-enforcing supervisors. Most existing studies have to fully enumerate the reachable markings of a Petri net model to obtain the FBMs, which exacerbates the computational overheads. This paper first explores a variation mechanism of calculating FBMs with respect to the resource capacity in a class of S 3 PR (Systems of Simple Sequential Processes with Resources) from the structural analysis perspective, which contains a ξ -resource. More generally, for the class of S 3 PR with an η-resource as defined in this paper, the FBMs can be calculated in an algebraic way by a customized structural analysis technique without enumerating all the reachable markings. Finally, the variation mechanism of calculating FBMs is revealed for these considered classes of Petri net models. Examples are given to demonstrate the proposed method.INDEX TERMS Petri net, first-met bad marking, deadlock control, automated manufacturing system.

show abstract

On-line verification of initial-state opacity by Petri nets and integer linear programming

Cited by 22 publications

References 25 publications

A Framework for Current-State Opacity under Dynamic Information Release Mechanism

A Framework for Current-State Opacity under Dynamic Information Release Mechanism

Current-state opacity verification in discrete event systems using an observer net

On Algebraic Identification of Critical States for Deadlock Control in Automated Manufacturing Systems Modeled With Petri Nets

Contact Info

Product

Resources

About