Bernd Puchala

Address

Research

I am working within the DFG research project Partielle Information in Logik und Spielen (partial information in logic and games) since November 2011 .

My research interests are centered around decidability and complexity of interaction under partial information. The main aspect is synthesizing winning strategies in games with imperfect information, especially infinite games played on finite graphs. This is closely related to automata theory, especially automata on infinite objects and to graph theory, especially graph complexity measures. Moreover, logics for describing certain aspects of interaction under partial information, like epistemic logics and dependence logics, play an important role.

From October 2008 until September 2011 I have been working within the ESF EUROCORES research project LogICCC, Collaborative Research Project Logic for Interaction (LINT).

Recent Publications

• D. Berwanger, Ł. Kaiser, and B. Puchala. A Perfect-Information Construction for Coordination in Games. In 31st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS '11, pp. 387-398. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011.
• W. Fridman and B. Puchala. Distributed Synthesis for Regular and Contextfree Specifications. In Proceedings of the 36th International Symosium on Mathematical Foundations of Computer Science, MFCS 2011, Lecture Notes in Computer Science, pp. 532–543. Springer, 2011.
• B. Puchala and R. Rabinovich. Graph Searching, Parity Games and Imperfect Information. arXiv:1110.5575v1 [cs.GT], 2011.
• B. Puchala. Asynchronous Omega-Regular Games with Partial Information. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science 2010, MFCS '10, vol. 6281 of LNCS, pp. 592–603. Springer, 2010.
• B. Puchala and R. Rabinovich. Parity Games with Partial Information Played on Graphs of Bounded Complexity. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science 2010, MFCS '10, vol. 6281 of LNCS, pp. 604–615. Springer, 2010.

All publications

Selected Talks

• Concurrent Graph Searching (Young Researchers Workshop on Concurrency Theory, Aachen, 2011)
• Distributed Synthesis for Regular and Contextfree Specifications (36th International Symposium on Mathematical Foundations of Computer Science, Warszawa, 2011)
• Asynchronous Omega-Regular Games with Partial Information (35th International Symposium on Mathematical Foundations of Computer Science, Brno, 2010)
• Parity Games with Partial Information Played on Graphs of Bounded Complexity (35th International Symposium on Mathematical Foundations of Computer Science, Brno, 2010)
• Knowledge and Cooperation in Infinite Games (LINT midterm meeting, Paris, 2010)
• Winning Strategies in Two-Player Games with Partial Information (LINT Workshop, Amsterdam, 2008)

Teaching

• Summer Term 2011

  • Seminar on Algorithmic Aspects of Parity Games

• Winter Term 2010/2011

  • Seminar on Guarded Logics

• Summer Term 2010

  • Seminar on Structural Complexity of Graphs and Graph Searching Games
  • Exercises for the course Mathematical Logic

• Winter Term 2009/2010

  • Seminar on Modern Solution Concepts in Game Theory
  • Exercises for the course Complexity Theory and Quantum Computing

• Summer Term 2009

  • Seminar on Fixed-Point Logics

• Winter Term 2008/2009

  • Seminar on Logic and (In)Dependence
  • Exercises for the course Mathematical Logic II

Office Hours

By appointment