The complexity of synthesis from probabilistic components

K. Chatterjee, L. Doyen, M. Vardi, 9135 (2015) 108–120.


Conference Paper | Published | English
Author
; ;
Department
Series Title
LNCS
Abstract
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 ∩ 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.
Publishing Year
Date Published
2015-06-20
Acknowledgement
This research was supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (SHiNE), ERC Start grant (279307: Graph Games), EU FP7 Project Cassting, NSF grants CNS 1049862 and CCF-1139011, by NSF Expeditions in Computing project “ExCAPE: Expeditions in Computer Augmented Program Engineering”, by BSF grant 9800096, and by gift from Intel.
Volume
9135
Page
108 - 120
Conference
ICALP: Automata, Languages and Programming
Conference Location
Kyoto, Japan
Conference Date
2015-07-06 – 2015-07-10
IST-REx-ID

Cite this

Chatterjee K, Doyen L, Vardi M. The complexity of synthesis from probabilistic components. 2015;9135:108-120. doi:10.1007/978-3-662-47666-6_9
Chatterjee, K., Doyen, L., & Vardi, M. (2015). The complexity of synthesis from probabilistic components. Presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan: Springer. https://doi.org/10.1007/978-3-662-47666-6_9
Chatterjee, Krishnendu, Laurent Doyen, and Moshe Vardi. “The Complexity of Synthesis from Probabilistic Components.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-47666-6_9.
K. Chatterjee, L. Doyen, and M. Vardi, “The complexity of synthesis from probabilistic components,” vol. 9135. Springer, pp. 108–120, 2015.
Chatterjee K, Doyen L, Vardi M. 2015. The complexity of synthesis from probabilistic components. 9135, 108–120.
Chatterjee, Krishnendu, et al. The Complexity of Synthesis from Probabilistic Components. Vol. 9135, Springer, 2015, pp. 108–20, doi:10.1007/978-3-662-47666-6_9.

Link(s) to Main File(s)
Access Level
OA Open Access

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar