Dietmar Berwanger

Address

Research

I am a research associate in the Logic and Complexity group of Erich Grädel. Previously, I was at EPFL Lausanne and at LaBRI Bordeaux.

My research is on logical and algorithmic foundations of interactive systems, in particular:

• theory of infinite games
• fixed-point logics, μ-calculus
• verification and synthesis of open systems
• graph structure theory and complexity

Teaching

Algorithmic Model Theory — Summer 2008.

Office hours: Monday, 1:30 — 3:30 pm. Other times on request.

Recent Publications

• D. Berwanger, E. Grädel, Ł. Kaiser, and R. Rabinovich. Entanglement and the Complexity of Directed Graphs. Theoretical Computer Science, vol. 463(0), pp. 2–25, 2012.
• D. Berwanger, Ł. Kaiser, and S. Lessenich. Solving Counter Parity Games. In Mathematical Foundations of Computer Science 2012 (B. Rovan, V. Sassone, and P. Widmayer, Eds.), vol. 7464 of Lecture Notes in Computer Science, pp. 160-171. Springer Berlin / Heidelberg, 2012.
• D. Berwanger, Ł. Kaiser, and S. Lessenich. Imperfect Recall and Counter Games. Technical Report. Laboratoire Spécification et Vérification, ENS Cachan, France, 2011.
• 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.
• D. Berwanger and Ł. Kaiser. Information Tracking in Games on Graphs. Journal of Logic, Language and Information, 2010.

All publications

New Tool

Alpaga -- A solver for parity games with imperfect information (alpha test)