Playing infinite games in finite time
A half-century of automata theory
Optimal Bounds for Transformations of omega-Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Automata logics, and infinite games
Ambiguous classes in µ-calculi hierarchies
Theoretical Computer Science - Foundations of software science and computation structures
Information Processing Letters
Finitary winning in ω-regular games
ACM Transactions on Computational Logic (TOCL)
Ambiguous classes in the games µ-calculus hierarchy
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Optimal strategy synthesis in stochastic Müller games
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Faster algorithms for finitary games
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Memory reduction for strategies in infinite games
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Stochastic Müller games are PSPACE-complete
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Finite state strategies in one player McNaughton games
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Optimizing winning strategies in regular infinite games
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Church's problem and a tour through automata theory
Pillars of computer science
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Synthesis of memory-efficient "real-time" controllers for safety objectives
Proceedings of the 14th international conference on Hybrid systems: computation and control
The complexity of request-response games
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Extracting winning strategies in update games
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
Weak automata for the linear time µ-calculus
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
The complexity of stochastic Müller games
Information and Computation
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Complexity bounds for regular games
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Efficient controller synthesis for consumption games with multiple resource types
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Strategy machines and their complexity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Logical refinements of Church's problem
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Playing stochastic games precisely
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems
Information and Computation
Synthesis for multi-objective stochastic games: an application to autonomous urban driving
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Hi-index | 0.00 |
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of the size of the I/O automata realizing winning strategies in games with this condition. This problem is relevant to synthesis of reactive programs and to the theory of automata on infinite objects. We provide matching upper and lower bounds for the size of memory needed by winning strategies in games with a fixed winning condition. We also show that in the general case the LAR (latest appearance record) data structure of Gurevich and Harrington is optimal. Then we propose a more succinct way of representing winning strategies by means of parallel compositions of transition systems. We study the question: which classes of winning conditions admit only polynomial-size blowup of strategies in this representation.