Synthesis from Probabilistic Components

TL;DR

This paper extends control-flow synthesis to probabilistic components, demonstrating that the problem remains decidable, unlike dataflow synthesis which is undecidable.

Contribution

It introduces the decidability of control-flow synthesis from libraries of probabilistic components, expanding the scope of synthesis techniques.

Findings

Control-flow synthesis from probabilistic components is decidable.

Dataflow synthesis remains undecidable.

The work broadens synthesis applicability to probabilistic systems.

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.