Concurrent Secrets

Author

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

Author_Institution

INRIA, Rennes

fYear

2006

fDate

10-12 July 2006

Firstpage

51

Lastpage

57

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

Keywords

concurrency control; finite state machines; observers; optimal control; security of data; concurrent secrets; finite control; finite state system; observers; optimal control; system control; system trajectory; Application software; Automata; Automatic control; Computer security; Concurrent computing; Control systems; Optimal control; Safety; Sufficient conditions; Supervisory control;

fLanguage

English

Publisher

ieee

Conference_Titel

Discrete Event Systems, 2006 8th International Workshop on

Conference_Location

Ann Arbor, MI

Print_ISBN

1-4244-0053-8

Type

conf

DOI

10.1109/WODES.2006.1678407

Filename

1678407