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.
Type de document :
[Research Report] PI 1887, 2008, pp.19
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

Contributeur : Anne Jaigu <>
Soumis le : mardi 25 mars 2008 - 15:24:01
Dernière modification le : mercredi 11 avril 2018 - 01:55:55
Document(s) archivé(s) le : mardi 21 septembre 2010 - 16:29:24


Fichiers produits par l'(les) auteur(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〉



Consultations de la notice


Téléchargements de fichiers