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, K. Chatterjee, L. Doyen, T. A. Henzinger, and S. Raje. Strategy Construction for Parity Games with Imperfect Information. In Proceedings of the 19th International Conference on Concurrency Theory, CONCUR 2008, vol. 5201 of LNCS, pp. 325-339. Springer, 2008.
• D. Berwanger, E. Grädel, and G. Lenzi. The variable hierarchy of the $\mu$-calculus is strict. Theory of Computing Systems, vol. 40, pp. 437–466, 2007.
• D. Berwanger. Admissibility in infinite games. In Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007 (W. Thomas and P. Weil, Eds.), vol. 4393 of LNCS, pp. 188–199. Springer, 2007.
• D. Berwanger, A. Dawar, P. Hunter, and S. Kreutzer. DAG-width and parity games. In Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2006, vol. 3884 of LNCS, pp. 524–536. Springer, 2006.
• D. Berwanger and D. Janin. Automata on Directed Graphs: Vertex versus Edge Marking. In Proceedings of the 3rd International Conference on Graph Transformation, ICGT 2006, vol. 4179 of LNCS, pp. 46–60. Springer, 2006.

All publications

New Tool

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