Dynamic Observers for the Synthesis of Opaque Systems

Abstract : In this paper, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability over G, if s/he can never infer from the observation of a run of G that the run belongs to S. We first investigate the case of static partial observability where the set of events the user can observe is fixed a priori. In this context, we show that checking whether a system is opaque is PSPACE-complete, which implies that computing an optimal static observer ensuring opacity is also a PSPACE-complete problem. Next, we introduce dynamic partial observability where the set of events the user can observe changes over time. We show how to check that a system is opaque w.r.t. to a dynamic observer and also address the corresponding synthesis problem: given a system G and secret states S, compute the set of dynamic observers under which S is opaque. Our main result is that the set of such observers can be finitely represented and can be computed in EXPTIME.
Type de document :
[Research Report] PI 1930, 2009, pp.22
Liste complète des métadonnées

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

Contributeur : Anne Jaigu <>
Soumis le : jeudi 18 juin 2009 - 10:43:07
Dernière modification le : mercredi 16 mai 2018 - 11:48:03
Document(s) archivé(s) le : mardi 15 juin 2010 - 17:32:45


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00396442, version 1


Franck Cassez, Jérémy Dubreil, Hervé Marchand. Dynamic Observers for the Synthesis of Opaque Systems. [Research Report] PI 1930, 2009, pp.22. 〈inria-00396442〉



Consultations de la notice


Téléchargements de fichiers