Skip to Main content Skip to Navigation

Opacity Enforcing Control Synthesis

Jérémy Dubreil 1 Philippe Darondeau 2 Hervé Marchand 1 
2 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : 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.
Document type :
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Anne Jaigu Connect in order to contact the contributor
Submitted on : Tuesday, March 25, 2008 - 3:24:01 PM
Last modification on : Friday, February 4, 2022 - 3:22:08 AM
Long-term archiving on: : Tuesday, September 21, 2010 - 4:29:24 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads