Opacity Enforcing Control Synthesis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

Opacity Enforcing Control Synthesis


Given a finite transition system and a regular predicate, we address the problem of computing a controller enforcing the opacity of the predicate against an attacker (who partially observes the system), supposedly trying to push the system to reveal the predicate. Assuming that the controller can only control a subset of the events it observes (possibly different from the ones of the attacker), we show that an optimal control always exists and provide sufficient conditions under which it is regular and effectively computable. These conditions rely on the inclusion relationships between the controllable alphabet and the observable alphabets of the attacker and of the controller.
Fichier principal
Vignette du fichier
PI-1887.pdf (305.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00265855 , version 1 (20-03-2008)
inria-00265855 , version 2 (25-03-2008)


  • HAL Id : inria-00265855 , version 2


Jérémy Dubreil, Philippe Darondeau, Hervé Marchand. Opacity Enforcing Control Synthesis. [Research Report] PI 1887, 2008, pp.19. ⟨inria-00265855v2⟩
196 View
188 Download


Gmail Facebook X LinkedIn More