The Complexity of Synthesis from Probabilistic Components

DOI10.1007/978-3-662-47666-6_9zbMath1440.68045arXiv1502.04844OpenAlexW2136045422MaRDI 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

The Complexity of Synthesis from Probabilistic Components

Uses Software

• PRISM

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Complexity of Synthesis from Probabilistic Components