Concurrent Secrets

Badouel, Eric; Bednarczyk, Marek A.; Borzyszkowski, Andrzej M.; Caillaud, Benoît; Darondeau, Philippe

doi:10.1109/wodes.2006.1678407

Cited by 39 publications

(42 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This definition generalizes the notions of secrecy considered in [2], [5], [12], which require only the first part above. When an observer does not know the exact behaviors of a discrete-event system (DES), a weaker notion of secrecy can be defined, which we introduce in this paper: For each property-satisfying event-trace of the system, there exists an indistinguishable property-violating event-trace (not necessarily executable in the system), and vice-versa.…”

Section: Introductionmentioning

confidence: 95%

“…Recently, secrecy-enforcing supervisory control has been studied in [2], [5], [12]. In [2], the authors considered the situation where there are multiple observers with different observable event sets, and addressed the problem of synthesizing a maximally permissive supervisor that guarantees that each observer never unambiguously knows whether an executed trace belongs to the traces representing a secret property.…”

Section: Introductionmentioning

confidence: 99%

“…In [2], the authors considered the situation where there are multiple observers with different observable event sets, and addressed the problem of synthesizing a maximally permissive supervisor that guarantees that each observer never unambiguously knows whether an executed trace belongs to the traces representing a secret property. Sufficient conditions under which such a maximally permissive supervisor can be effectively computed were presented under the assumption that all events are controllable.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Verification and synthesis for secrecy in discrete-event systems

Takai

Kumar

2009

2009 American Control Conference

View full text Add to dashboard Cite

Keeping a property of system behaviors secret from an observer (who has a partial observation of any executed behavior) requires that the execution of any property-satisfying or property-violating behavior must not become known to the observer. When an observer does not know the exact behaviors of a system it observes, a weaker notion of secrecy can be defined, which we introduce in this paper. We present an algorithm for verifying the properties of secrecy as well as its weaker version. When a given system does not possess a secrecy property, we consider restricting the behaviors of the system by means of supervisory control so as to ensure that the controlled system satisfies the desired secrecy property. We show the existence of a maximally permissive supervisor to ensure secrecy or its weaker version, and present algorithms for their synthesis.

show abstract

Section: Introductionmentioning

confidence: 95%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Verification and synthesis for secrecy in discrete-event systems

Takai

Kumar

2009

2009 American Control Conference

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: 99%

“…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

Concurrent Secrets

Cited by 39 publications

References 3 publications

Verification and synthesis for secrecy in discrete-event systems

Verification and synthesis for secrecy in discrete-event systems

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