Games, logic and Automata Seminar
In this seminar we will study topics related to games, logic and automata and a rich interplay between them.
Requirements: (a) give a lecture. (b) actively participate in the lectures of other students.
We will use book Automata, Logic and infinite games, edited by Gradel, Thomas and Wilke, LNCS 2500.
you can download the book from here
Here you can find many interesting papers. Games, logic and Automata training network and choose one of them to present.
Slides Games - basic notions. slides
P. Madhusudan: Synthesizing Reactive Program. In CSL 2011.
Julien Cristau and Florian Horn. Graph Games on Ordinals. In Proceedings of the 28th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'08
Uri Zwick,
Michael S. Paterson,
The complexity of mean payoff games on graphs
Theoretical Computer Science 158, 343-359 (1996).
D. M. Gabbay, A. Pnueli,
S. Shelah, J. Stavi.
On the Temporal Analysis of Fairness. 7th POPL, pp. 163-173, 1980.
Nondeterministic controllers of nondeterministic processes
Andre Arnold & Igor Walukiewicz, in J. Flum, E. Graedel, T. Wilke eds. "Logic and
Automata", Texts in Logic and Games, Amsterdam University
Press, 2007
Structured strategies in Games on graphs.
R. Ramanujam and Sanil Simon
in "Logic and Automata", Texts in Logic and Games, Amsterdam University
Press, 2007
Kristoffer Arnsfelt Hansen, Michal Koucky and Peter Bro Miltersen. Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. In LICS 2009.
Y. Lustig, S. Nain and Vardi.
Synthesis from Probabilistic Components CSL'11 .
James Gross, Frank G. Radmacher, and Wolfgang Thomas.
A game-theoretic approach to routing under adversarial conditions. In Proceedings of the 6th IFIP International Conference on Theoretical Computer Science, IFIP TCS 2010, volume 323 of IFIP Advances in Information and Communication Technology, pages 355-370. Springer, 2010
N. Fijalkow and F. Horn. The surprizing complexity of reachability games.