Distributed Synthesis with Incomparable Information

Béatrice Bérard 1 Serge Haddad 2 Mathieu Sassolas 1 Marc Zeitoun 3, 2
1 MoVe - Modélisation et Vérification
LIP6 - Laboratoire d'Informatique de Paris 6
2 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
3 Laboratoire Bordelais de recherche en informatique
LaBRI - Laboratoire Bordelais de Recherche en Informatique
Abstract : Given (1) an architecture defined by processes and communication channels between them or with the environment, and (2) a specification on the messages transmitted over the channels, distributed synthesis aims at deciding existence of local programs, one for each process, that together meet the specification, whatever the environment does. Recent work shows that this problem can be solved when a linear preorder sorts the agents w.r.t. the information received from the environment. In this paper we show a new decidability result in the case where this preorder is broken by the addition of noisy agents embedded in a pipeline architecture. This case cannot be captured by the classical framework. Besides, this architecture makes it possible to model particular security threats, known as covert channels, where two users (the sender and the receiver) manage to communicate via a noisy protocol, and despite incomparable views over the environment.
Document type :
Liste complète des métadonnées

Contributor : Stefan Haar <>
Submitted on : Tuesday, January 22, 2013 - 5:17:23 PM
Last modification on : Tuesday, April 2, 2019 - 1:45:43 AM


  • HAL Id : hal-00779927, version 1


Béatrice Bérard, Serge Haddad, Mathieu Sassolas, Marc Zeitoun. Distributed Synthesis with Incomparable Information. [Research Report] LSV-10-17, LSV. 2010. ⟨hal-00779927⟩



Record views