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 or Highlights of logics, games automata and choose one of them to present.
Here are the slides I presented on Logic - basic notions. slides
Guy Lando 09/03: Omega-Automata. Chapter 1 in Automata, Logic and infinite games, edited by Gradel, Thomas and Wilke, LNCS 2500. slides and notes
David Frid 16/03 Infinite Games. Chapter 2 in Automata, Logic and infinite games, edited by Gradel, Thomas and Wilke, LNCS 2500.
Noam Iluz 23/03: Orna Kupferman Automata Theory and Model Checking (closure under complementation Sect 2) slides
Arar Moab 30/3: Parity Games. Chapter 6 in Automata, Logic and infinite games, edited by Gradel, Thomas and Wilke, LNCS 2500.
slides
Or Kamara 06//04: Chapter 8. Nondeterministic Tree Automata in Automata, Logic and infinite games, edited by Gradel, Thomas and Wilke, LNCS 2500. slides
Tomer Avni 13/04: A deterministic subexponential algorithm for solving parity games Marcin Jurdzinski Mike Paterson and Uri Zwick. In SIAM Journal on Computing, 2008
Baruch Weizman 18/04: Chapter 9. Alternating Tree Automata in Automata, Logic and infinite games, edited by Gradel, Thomas and Wilke, LNCS 2500.
Idan Shabat: 4/05 Laurent Doyen and Jean-François Raskin. Games with Imperfect Information: Theory and Algorithms . Lectures in Game Theory for Computer Scientists. Cambridge University Press, 2011, pp. 185-212.
Edi Dav: 18/05 Apt. Selfishness Level of Strategic Games
Tzvika Geft: 25/05 Simon and K. R. Apt. Choosing Products in Social Networks.
H. Gimbert and W. Zielonka. Games where you can play optimally without any memory. In CONCUR 2005, volume 3653 of LNCS, pages 428-442, 2005. Springer
Thomas Colcombet, Nathanaël Fijalkow, and Florian Horn. “Playing Safe”. In: FSTTCS 2014: Foundations of Software Technology and Theoretical Computer Science. Edited by Venkatesh Raman and S. P. Suresh. Volume 29. LIPICs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pages 379–390.
K. Etessami "Analysis of Probabilistic Processes and Automata Theory". DRAFT of Chapter in forthcoming Handbook of Automata Theory, editor Jean-Eric Pin, European Mathmatical Society publishing (EMS) (ONLY part of this survey should be covered in the presentation)
Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen
Krishnendu Chatterjee, Laurent Doyen. Energy Parity Games . Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science 6199, Springer, 2010, pp. 599-610
Uri Klein, Nir Piterman, Amir Pnueli: Effective Synthesis of Asynchronous Systems from GR(1) Specifications. VMCAI 2012: 283-298