Software Synthesis is Hard – and Simple

Author Sven Schewe

Thumbnail PDF


  • Filesize: 119 kB
  • 4 pages

Document Identifiers

Author Details

Sven Schewe

Cite AsGet BibTex

Sven Schewe. Software Synthesis is Hard – and Simple. In Software Synthesis. Dagstuhl Seminar Proceedings, Volume 9501, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


While the components of distributed hardware systems can reasonably be assumed to be synchronised, this is not the case for the components of distributed software systems. This has a strong impact on the class of synthesis problems for which decision procedures exist: While there is a rich family of distributed systems, including pipelines, chains, and rings, for which the realisability and synthesis problem is decidable if the system components are composed synchronously, it is well known that the asynchronous synthesis problem is only decidable for monolithic systems. From a theoretical point of view, this renders distributed software synthesis undecidable, and one is tempted to conclude that synthesis of asynchronous systems, and hence of software, is much harder than the synthesis of synchronous systems. Taking a more practical approach, however, reveals that bounded synthesis, one of the most promising synthesis techniques, can easily be extended to asynchronous systems. This merits the hope that the promising results from bounded synthesis will carry over to asynchronous systems as well.
  • Synthesis
  • Temporal Logics


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail