The Complexity of Synthesis from Probabilistic Components
From MaRDI portal
Publication:3449469
DOI10.1007/978-3-662-47666-6_9zbMath1440.68045arXiv1502.04844MaRDI QIDQ3449469
Moshe Y. Vardi, Laurent Doyen, Krishnendu Chatterjee
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.04844
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reduction of stochastic parity to stochastic mean-payoff games
- Synthesis from Component Libraries with Costs
- The Complexity of Synthesis from Probabilistic Components
- Synthesis from Component Libraries
- The Complexity of Solving Stochastic Games on Graphs
- The complexity of probabilistic verification
- Modular Synthesis with Open Components
- The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies
- Synthesis from Probabilistic Components
