Extracting Winning Strategies in Update Games

DOI10.1007/978-3-642-21875-0_15zbMath1345.91004OpenAlexW1565610892MaRDI QIDQ3091450

Imran Khaliq, Bakhadyr Khoussainov, Jiamou Liu

Publication date: 9 September 2011

Published in: Models of Computation in Context (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10292/2807

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Applications of game theory (91A80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Update games and update networks
• Infinite games played on finite graphs
• Automata, logics, and infinite games. A guide to current research
• McNaughton games and extracting strategies for concurrent programs
• Mathematical Foundations of Computer Science 2005
• Depth-First Search and Linear Graph Algorithms
• On model checking for the \(\mu\)-calculus and its fragments

This page was built for publication: Extracting Winning Strategies in Update Games