Skip to main content
SpringerLink
Log in

Concurrent Secrets

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

Given a finite state system with partial observers and for each observer, a regular set of trajectories which we call a secret, we consider the question whether the observers can ever find out that a trajectory of the system belongs to some secret. We search for a regular control on the system, enforcing the specified secrets on the observers, even though they have full knowledge of this control. We show that an optimal control always exists although it is generally not regular. We state sufficient conditions for computing a finite and optimal control of the system enforcing the concurrent secret as desired.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Arnold A, Nivat M (1982) Comportements de processus. In: Actes du Colloque AFCET “Les mathématiques de l’informatique”, pp 35–68

  • Berstel J (1978) Transductions and context-free languages. Teubner

  • Bryans JW, Koutny M, Mazaré L, Ryan PYA (2006) Opacity generalised to transition systems. In: revised selected papers of the 3rd international workshop on formal aspects in security and trust (FAST 2005). LNCS, vol 3866. Newcastle upon Tyne, UK, Springer Verlag, pp 81–95

  • Eilenberg S (1974) Automata, languages and machines, vol A. Academic, New York

    MATH  Google Scholar 

  • Ginzburg A (1968) Algebraic theory of automata. Academic, New York

    MATH  Google Scholar 

  • Mazaré L (2004) Using unification for opacity properties. In: Proc. of the 4th IFIP WG1.7 Workshop on Issues in the Theory of Security (WITS’04), Barcelona, Spain, pp 165–176

  • Ramadge PJ, Wonham WM (1987a) Supervisory control of a class of discrete event processes. SIAM J Control Optim 25:206–230

    Article  MATH  MathSciNet  Google Scholar 

  • Ramadge PJ, Wonham WM (1987b) On the supremal controllable language of a given language. SIAM J Control Optim 25:637–659

    Article  MathSciNet  Google Scholar 

  • Tarski A (1955) A lattice-theoretical fixpoint theorem and its applications. Pacific J Math 5:285–309

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA, campus de Beaulieu, 35042, Rennes Cedex, France

    E. Badouel, B. Caillaud & P. Darondeau

  2. IPIPAN, Abrahama 18, 81-825, Sopot, Poland

    M. Bednarczyk

  3. Inst. of Math., Gdańsk University, Wita Stwosza 57, 80-952, Gdańsk, Poland

    A. Borzyszkowski

Authors
  1. E. Badouel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Bednarczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Borzyszkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. B. Caillaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. P. Darondeau
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P. Darondeau.

Additional information

The biographies and photos of the authors are not available.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Badouel, E., Bednarczyk, M., Borzyszkowski, A. et al. Concurrent Secrets. Discrete Event Dyn Syst 17, 425–446 (2007). https://doi.org/10.1007/s10626-007-0020-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-007-0020-5

Keywords

Search

Navigation