Synthesis from probabilistic components
From MaRDI portal
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.
Recommendations
- Synthesis from probabilistic components
- The Complexity of Synthesis from Probabilistic Components
- Synthesis for Probabilistic Environments
- scientific article; zbMATH DE number 1241797
- scientific article; zbMATH DE number 1863173
- Synthesizing Probabilistic Composers
- Compositional parameter synthesis
- scientific article; zbMATH DE number 14501
- Synthesizing efficient systems in probabilistic environments
Cited in
(9)- Synthesizing Probabilistic Composers
- Synthesis from recursive-components libraries
- The Complexity of Synthesis from Probabilistic Components
- Synthesis from Component Libraries
- High-Quality Synthesis Against Stochastic Environments
- Compositional parameter synthesis
- scientific article; zbMATH DE number 14501 (Why is no real title available?)
- Synthesis from component libraries with costs
- Synthesis from probabilistic components
This page was built for publication: Synthesis from probabilistic components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915699)
