Opacity generalised to transition systems

Bryans, Jeremy; Koutny, Maciej; Mazaré, Laurent; Ryan, Peter Y. A.

doi:10.1007/s10207-008-0058-x

Cited by 207 publications

(59 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The classical notion of opacity, as defined in [11], deals with finite traces only. For our purpose, we fix a subset S of Σ containing special secret letters such that O(s) = ε for all s ∈ S. We consider as secret any sequence containing some s ∈ S, hence the set of finite secrets in an LTS A is Sec * (A) Note that Strong Nondeterministic Non-Interference (SNNI) as studied for example in [16,17] is a particular case of opacity where O is restricted to be the projection from Σ * onto (Σ \ S) * , i.e.…”

Section: Opacitymentioning

confidence: 99%

“…The same reduction was used in [11,Thm. 6] to establish undecidability for the so-called initial opacity state-based variant of opacity in Petri nets.…”

Section: Opacitymentioning

confidence: 99%

“…The related notion of opacity was introduced for general transition systems in [11]. The system has a secret subset of executions which is opaque if for any secret execution, there is a nonsecret one with the same observation: an observer can never be sure whether the current execution is secret or not.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The Complexity of Diagnosability and Opacity Verification for Petri Nets

Bérard¹,

Haar

Schmitz

et al. 2018

View full text Add to dashboard Cite

Abstract. Diagnosability and opacity are two well-studied problems in discrete-event systems. We revisit these two problems with respect to expressiveness and complexity issues.We first relate different notions of diagnosability and opacity. We consider in particular fairness issues and extend the definition of Germanos et al. [ACM TECS, 2015] of weakly fair diagnosability for safe Petri nets to general Petri nets and to opacity questions.Second, we provide a global picture of complexity results for the verification of diagnosability and opacity. We show that diagnosability is NL-complete for finite state systems, PSPACE-complete for safe convergent Petri nets (even with fairness), and EXPSPACE-complete for general Petri nets without fairness, while non diagnosability is inter-reducible with reachability when fault events are not weakly fair. Opacity is ESPACE-complete for safe Petri nets (even with fairness) and undecidable for general Petri nets already without fairness.

show abstract

Section: Opacitymentioning

confidence: 99%

“…The same reduction was used in [11,Thm. 6] to establish undecidability for the so-called initial opacity state-based variant of opacity in Petri nets.…”

Section: Opacitymentioning

confidence: 99%

See 1 more Smart Citation

The Complexity of Diagnosability and Opacity Verification for Petri Nets

Bérard¹,

Haar

Schmitz

et al. 2018

View full text Add to dashboard Cite

show abstract

“…Even under partial observation, some hidden information may be computationally reconstructible from some specification of the system. Typical fields that address such issues are those of information flow detection (Badouel et al 2007;Bryans et al 2008;Cassez 2009), diagnosis (Sampath et al 1995;Yoo and Lafortune 2002;Jéron et al 2006;Tripakis 2002;Bouyer et al 2005), and combination of both (Dubreil et al 2009). …”

Section: Introductionmentioning

confidence: 98%

“…On the one hand, information flow detection relates to computer security, based on the notion of opacity (Bryans et al 2008;Badouel et al 2007;Dubreil et al 2009). The opacity problem consists in determining whether an observer, who knows the system's behavior but who imperfectly observes it, is able to reconstruct critical information (e.g., a password stored in a file, the value of some hidden variables, etc.).…”

Section: Introductionmentioning

confidence: 99%

Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems

Chédor

Morvan

Pinchinat

et al. 2014

Discrete Event Dyn Syst

View full text Add to dashboard Cite

The analysis of discrete event systems under partial observation is an important topic, with major applications such as the detection of information flow and the diagnosis of faulty behaviors. These questions have, mostly, not been addressed for classical models of recursive systems, such as pushdown systems and recursive state machines. In this paper, we consider recursive tile systems, which are recursive infinite systems generated by a finite collection of finite tiles, a simplified variant of deterministic graph grammars (slightly more general than pushdown systems). Since these systems are infinite-state in general powerset constructions for monitoring do not always apply. We exhibit computable conditions on recursive tile systems and present non-trivial constructions that yield effective computation of the monitors. We apply these results to the classic problems of state-based opacity and diagnosability (off-line verification of opacity and diagnosability, and also runtime monitoring of these properties). For a decidable subclass of recursive tile systems, we also establish the decidability of the problems of state-based opacity and diagnosability.

show abstract

Estimation and Verification of Partially Observed Discrete‐Event Systems

Yin

2019

Wiley Encyclopedia of Electrical and Electronics Engineering

View full text Add to dashboard Cite

State estimation is one of the most fundamental problems in the systems and control theory. In many real-world systems, it is not always possible to access the full information of the system due to measurement noises/uncertainties and the existence of adversaries. Therefore, how to estimate the state of the system is crucial when one wants to make decisions based on the limited and incomplete information.Given a system, one of the most important questions is to prove/disprove the correctness of the system with respect to some desired requirement (or specification). In particular, we would like to check the correctness of the system in a formal manner in the sense that the checking procedures are algorithmic and results have provable correctness guarantees. Such a formal satisfaction checking problem is referred to as the verification problem. Performing formal property verification is very important for many complicated but safety-critical infrastructures.This article considers state estimation and verification problems for an important class of man-made cyber-physical systems called Discrete-Event Systems (DES). Roughly speaking, DES are dynamic systems with discrete state-spaces and event-triggered dynamics. DES models are widely used in the study of complex automated systems where the behavior is inherently eventdriven, as well as in the study of discrete abstractions of continuous, hybrid, and/or cyber-physical systems. Over the past decades, the theory of DES has been successfully applied to many real-world problems, e.g., the control of

show abstract

Opacity generalised to transition systems

Cited by 207 publications

References 24 publications

The Complexity of Diagnosability and Opacity Verification for Petri Nets

The Complexity of Diagnosability and Opacity Verification for Petri Nets

Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems

Estimation and Verification of Partially Observed Discrete‐Event Systems

Contact Info

Product

Resources

About