Dietmar Berwanger

Adresse

Forschung

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

Lehre

Algorithmische Modelltheorie — Sommer 2008.

Sprechstunde: Montag, 13:30 -- 15:30 Uhr. Andere Zeiten auf Anfrage.

Aktuelle Publikationen

• E. Grädel, Ł. Kaiser, D. Berwanger, and R. Rabinovich. Entanglement and the Complexity Measures for Directed Graphs. Submitted for publication.
• 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 Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011. To Appear, 2011.
• D. Berwanger and Ł. Kaiser. Information Tracking in Games on Graphs. Journal of Logic, Language and Information, 2010.
• 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.

Alle Publikationen

Neu!

Alpaga -- Ein Algorithmus zur Lösung von Paritätsspielen mit imperfekter Information (Alphatest)