McNaughton games and extracting strategies for concurrent programs

DOI10.1016/0168-0072(95)00032-1zbMath0859.68026OpenAlexW2000900855MaRDI QIDQ1919769

Alexander Yakhnis, Anil Nerode, Jeffery B. Remmel

Publication date: 31 March 1997

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(95)00032-1

zbMATH Keywords

Büchi-Landweber gameMcNaughton gamesproducer-consumer problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Differential Game Logic, Unnamed Item, Update games and update networks, Unnamed Item, Unnamed Item, Quantitative reductions and vertex-ranked infinite games, Extracting Winning Strategies in Update Games

Cites Work

• Gurevich-Harrington's games defined by finite automata
• Hybrid systems
• Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies
• Infinite games played on finite graphs
• Solving Sequential Conditions by Finite-State Strategies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item