Solving counter parity games

DOI10.1007/978-3-642-32589-2_17MaRDI QIDQ2912718zbMATH OpenOpenAlexFDO

Authors Dietmar Berwanger, Łukasz Kaiser, Simon Leßenich

Publication date 25 September 2012

Published in Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32589-2_17

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Algorithms for solving parity games
• Parity and Streett games with costs
• Cost-parity and cost-Streett games
• scientific article; zbMATH DE number 7533361
• Parity games with weights

Cited in

(13)

• Mathematical Foundations of Computer Science 2003
• Solving Games Without Determinization
• Uniform strategies, rational relations and jumping automata
• Solving Parity Games on the GPU
• Solving parity games by a reduction to SAT
• Computing Game Values for Crash Games
• A parity game tale of two counters
• On the complexity of counter reachability games
• Solving parity games on integer vectors
• Computer solution to the game of pure strategy
• Trading bounds for memory in games with counters
• On the power of imperfect information
• Two-player boundedness counter games

This page was built for publication: Solving counter parity games

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