Synthesis of finite-state and definable winning strategies

DOI10.4230/LIPICS.FSTTCS.2009.2332MaRDI QIDQ2920143zbMATH OpenOpenAlexFDO

Authors Alexander Rabinovich

Publication date 24 October 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_4bbd.html

zbMATH Keywords

composition methodmonadic logicChurch synthesis problemgames of ordinal length

Mathematics Subject Classification ID

Applications of game theory (91A80) 2-person games (91A05) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Recommendations

• Defining winning strategies in fixed-point logic
• On the synthesis of strategies in infinite games
• scientific article; zbMATH DE number 2077117
• Determinization and memoryless winning strategies
• Synthesising Succinct Strategies in Safety and Reachability Games
• Tools and Algorithms for the Construction and Analysis of Systems
• scientific article; zbMATH DE number 2086664
• Finite-state strategies in delay games
• Finite-state strategies in delay games
• Finite reasoning procedures for dynamic games

Cited in

(7)

• Finite-state strategies in delay games
• Solution of Church's problem: a tutorial
• Graph games on ordinals
• scientific article; zbMATH DE number 2040951 (Why is no real title available?)
• Logical Refinements of Church’s Problem
• Church’s Problem and a Tour through Automata Theory
• Finite-state strategies in delay games

This page was built for publication: Synthesis of finite-state and definable winning strategies

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