Dietmar Berwanger
Researcher, CNRS
Research Interests
Logical and algorithmic foundations of interaction:
- theory of infinite games
- fixed-point logics, μ-calculus
- verification and synthesis of open systems
- graph structure theory and complexity
Recent Papers
- D. Berwanger and Ł. Kaiser, Information Tracking in Games on Graphs. In
Journal of Logic, Language and Information,
Springer-Verlag, 2010, Online First.
- D. Berwanger, K. Chatterjee, L. Doyen, Th. A. Henzinger, and M. De Wulf, Strategy Construction for Parity Games with Imperfect Information, in Information and Computation, Elsevier. To appear.
- D. Berwanger, Infinite Coordination Games. In
Logic and the Foundations of Game and Decision Theory (LOFT8), Texts in Logic and Games, Amsterdam University Press. To appear.
- D. Berwanger, A. Dawar, P. Hunter, and S. Kreutzer, The DAG-Width of Directed Graphs. Under review.
More
publications
Events
Teaching
Projects
- GAMES - Games for Design and Verification
- LINT - Logic for Interaction
