The complexity of quantitative concurrent parity games

DOI10.1145/1109557.1109631MaRDI QIDQ3581549zbMATH OpenOpenAlexFDO

Authors Krishnendu Chatterjee, Luca De Alfaro, 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

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

Cited in

(14)

• Concurrent games with tail objectives
• Concurrent reachability games
• Recursive Markov decision processes and recursive stochastic games
• An algorithm for probabilistic alternating simulation
• Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
• Graph Games and Reactive Synthesis
• Symbolic model checking in non-Boolean domains
• Value Iteration
• On Omega-Languages Defined by Mean-Payoff Conditions
• A survey of stochastic -regular games
• Subgame optimal strategies in finite concurrent games with prefix-independent objectives
• From local to global optimality in concurrent parity games
• Concurrent stochastic games with stateful-discounted and parity objectives: complexity and algorithms
• CEGAR for compositional analysis of qualitative properties in Markov decision processes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581549)