Concurrent Secrets

Eric Badouel (1) , Marek Bednarczyk (2) , Andrzej Borzyszkowski (3) , Benoit Caillaud (1) , Philippe Darondeau (1)

1 S4 - System synthesis and supervision, scenarios
2 IPI PAN - Instytut Podstaw Informatyki
3 Instytut Matematyki [Gdańsk]

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 the 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. We briefly point to applications.

Mots clés: SECRETS; OPACITY; FINITE CONTROL

Domaines: Autre [cs.OH]

Eric Badouel, Marek Bednarczyk, Andrzej Borzyszkowski, Benoit Caillaud, Philippe Darondeau. Concurrent Secrets. [Research Report] RR-5771, INRIA. 2005, pp.22. ⟨inria-00070249⟩