Synthesis from Probabilistic Components

Authors Yoad Lustig, Sumit Nain, Moshe Y. Vardi



PDF
Thumbnail PDF

File

LIPIcs.CSL.2011.412.pdf
  • Filesize: 0.51 MB
  • 16 pages

Document Identifiers

Author Details

Yoad Lustig
Sumit Nain
Moshe Y. Vardi

Cite AsGet BibTex

Yoad Lustig, Sumit Nain, and Moshe Y. Vardi. Synthesis from Probabilistic Components. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 412-427, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.CSL.2011.412

Abstract

Synthesis is the automatic construction of a system from its specification. In classical synthesis algorithms, it is always assumed that the system is "constructed from scratch" rather than composed from reusable components. This, of course, rarely happens in real life, where almost every non-trivial commercial software system relies heavily on using libraries of reusable components. Furthermore, other contexts, such as web-service orchestration, can be modeled as synthesis of a system from a library of components. Recently, Lustig and Vardi introduced dataflow and control-flow synthesis from libraries of reusable components. They proved that dataflow synthesis is undecidable, while control-flow synthesis is decidable. In this work, we consider the problem of control-flow synthesis from libraries of probabilistic components. We show that this more general problem is also decidable.
Keywords
  • temporal synthesis
  • probabilistic components

Metrics

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

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail