The Complexity of Synthesis from Probabilistic Components
The synthesis problem asks for the automatic construction of a system from its specification. In the traditional setting, the system is “constructed from scratch” rather than composed from reusable components. However, this is rare in practice, and almost every non-trivial software system relies heavily on the use of libraries of reusable components. Recently, Lustig and Vardi introduced dataflow and controlflow synthesis from libraries of reusable components. They proved that dataflow synthesis is undecidable, while controlflow synthesis is decidable. The problem of controlflow synthesis from libraries of probabilistic components was considered by Nain, Lustig and Vardi, and was shown to be decidable for qualitative analysis (that asks that the specification be satisfied with probability 1). Our main contribution for controlflow synthesis from probabilistic components is to establish better complexity bounds for the qualitative analysis problem, and to show that the more general quantitative problem is undecidable. For the qualitative analysis, we show that the problem (i) is EXPTIME-complete when the specification is given as a deterministic parity word automaton, improving the previously known 2EXPTIME upper bound; and (ii) belongs to UP \(\cap \) coUP and is parity-games hard, when the specification is given directly as a parity condition on the components, improving the previously known EXPTIME upper bound.
KeywordsPure Strategy Index Function Stochastic Game Synthesis Problem Exit State
Unable to display preview. Download preview PDF.
- 2.Avni, G., Kupferman, O.: Synthesis from Component Libraries with Costs. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 156–172. Springer, Heidelberg (2014) Google Scholar
- 3.Baier, C., Katoen, J.-P.: Principles of Model Checking (Representation and Mind Series). The MIT Press (2008)Google Scholar
- 4.Chatterjee, K.: Stochastic \(\omega \)-regular Games. PhD thesis, UC Berkeley (2007)Google Scholar
- 6.Chatterjee, K., Doyen, L., Vardi. M. Y.: The complexity of synthesis from probabilistic components. CoRR, abs/1502.04844 (2015)Google Scholar
- 8.Chatterjee, K., Jurdziński, M., Henzinger, T.A.: Quantitative stochastic parity games. In: SODA 2004, pp. 114–123 (2004)Google Scholar
- 14.Nain, S., Lustig, Y., Vardi, M.Y.: Synthesis from probabilistic components. LMCS 10(2) (2014)Google Scholar
- 15.Paz, A.: Introduction to probabilistic automata. Academic Press Inc. (1971)Google Scholar
- 16.Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. of POPL, pp. 179–190. ACM Press (1989)Google Scholar
- 17.Sifakis, J.: A framework for component-based construction extended abstract. In: SFEM 2005, pp. 293–300 (2005)Google Scholar
- 18.Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state systems. In: FOCS 1985, pp. 327–338 (1985)Google Scholar