Synthesis from Probabilistic Components

Abstract

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 controlflow 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.

Synthesizing Probabilistic Composers

“…We observe that while one might hope to solve the more general case of probabilistic composers by using the methods of [8], there are two main difficulties with that approach. First, in [8], the DPW version of the problem is solved by reducing it to the embedded parity version.…”

“…We observe that while one might hope to solve the more general case of probabilistic composers by using the methods of [8], there are two main difficulties with that approach. First, in [8], the DPW version of the problem is solved by reducing it to the embedded parity version. However, as we show in the next section, while deterministic and probabilistic composers have the same expressive power for embedded parity specifications, probabilistic composers are strictly more expressive than deterministic composers for DPW specifications.…”

“…In previous work [8], the synthesis problem for probabilistic components was shown to be decidable for both DPW and embedded parity specifications. However, while the components there were probabilistic, the composer, and thus the control-flow of the composite system, was still deterministic.…”

“…In [8], the DPW synthesis problem for deterministic composers is solved by reducing it to the embedded parity version. But for probabilistic composers, a similar approach does not work because their expressive power differs for embedded parity and DPW specifications.…”

Solving Partial-Information Stochastic Parity Games

“…One-sided partial-information games are important because they are a natural model for the behavior of modular systems that interact with an environment, where the interactions between the modular components are globally visible but the computation within each component is not visible to other components. For example, synthesis from components can be viewed as such a game [11].…”