Distributed Synthesis for Well-Connected Architectures

  • Paul Gastin
  • Nathalie Sznajder
  • Marc Zeitoun
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4337)


We study the synthesis problem for external linear or branching specifications and distributed, synchronous architectures with arbitrary delays on processes. External means that the specification only relates input and output variables. We introduce the subclass of uniformly well-connected (UWC) architectures for which there exists a routing allowing each output process to get the values of all inputs it is connected to, as soon as possible. We prove that the distributed synthesis problem is decidable on UWC architectures if and only if the set of all sets of input variables visible by output variables is totally ordered, under set inclusion. We also show that if we extend this class by letting the routing depend on the output process, then the previous decidability result fails. Finally, we provide a natural restriction on specifications under which the whole class of UWC architectures is decidable.


Output Process Local Strategy Synthesis Problem Tree Automaton Input Word 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ahlswede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network information flow. IEEE Trans. Inform. Theory 46(4), 1204–1216 (2000)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Church, A.: Logic, arithmetic, and automata. In: Int. Symp. of Mathematicians, pp. 23–35 (1962)Google Scholar
  3. 3.
    Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: Proc. 20th IEEE Symp. on Logic in Computer Science (LICS 2005). IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
  4. 4.
    Gastin, P., Sznajder, N., Zeitoun, M.: Distributed synthesis for well-connected architectures. Technical report, LSV (2006)Google Scholar
  5. 5.
    Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: Proceedings of LICS 2001. Computer Society Press (2001)Google Scholar
  6. 6.
    Kupferman, O., Vardi, M.Y.: Church’s problem revisited. The Bulletin of Symbolic Logic 5(2), 245–263 (1999)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Lehman, A.R., Lehman, E.: Complexity classification of network information flow problems. In: Proceedings of SODA 2004, pp. 142–150. SIAM, Philadelphia (2004)Google Scholar
  8. 8.
    Madhusudan, P., Thiagarajan, P.S.: Distributed controller synthesis for local specifications. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 396–407. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Muller, D.E., Schupp, P.E.: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton and Safra. Theoret. Comput. Sci. 2(1), 90–121 (1995)MathSciNetGoogle Scholar
  10. 10.
    Peterson, G., Reif, J.: Multiple-person alternation. In: 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, pp. 348–363. IEEE, New York (1979)Google Scholar
  11. 11.
    Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proceedings of 31st IEEE Symp. FOCS, pp. 746–757 (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Paul Gastin
    • 1
  • Nathalie Sznajder
    • 1
  • Marc Zeitoun
    • 2
  1. 1.LSV, ENS de Cachan & CNRSCachan CedexFrance
  2. 2.LaBRI, Université Bordeaux 1 & CNRSTalence CedexFrance

Personalised recommendations