The complexity of quantitative concurrent parity games

DOI10.1145/1109557.1109631zbMath1192.68430OpenAlexW4235184093MaRDI QIDQ3581549

Luca de Alfaro, Krishnendu Chatterjee, Thomas A. Henzinger

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109631

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games involving graphs (91A43) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (12)

An Algorithm for Probabilistic Alternating Simulation ⋮ Graph Games and Reactive Synthesis ⋮ Symbolic Model Checking in Non-Boolean Domains ⋮ Subgame optimal strategies in finite concurrent games with prefix-independent objectives ⋮ A survey of stochastic \(\omega \)-regular games ⋮ Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games ⋮ Value Iteration ⋮ Concurrent games with tail objectives ⋮ Concurrent reachability games ⋮ Recursive Markov Decision Processes and Recursive Stochastic Games ⋮ On Omega-Languages Defined by Mean-Payoff Conditions ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes

This page was built for publication: The complexity of quantitative concurrent parity games