RWTH Aachen
| RWTH
Mathematische Grundlagen der Informatik |
MGI
52056 Aachen, Germany
Office: 4119 (E1) / Ahornstr. 55
Phone: (+49) 241 802 17 15 •
Fax: (+49) 241 802 22 15
Email: berwanger@logic.rwth-aachen.de
I am a research associate in the Logic and Complexity group of Erich Grädel. Previously, I have been at EPF Lausanne and LaBRI Bordeaux.
My research is on logical and algorithmic foundations of interactive systems, in particular:
Office hours: Monday, 1:30 -- 3:30 pm. Other times on request.
| [1] |
D. Berwanger, Admissibility in infinite games,
Proceedings of STACS 2007 -- Symposium on Theoretical Aspects of Computer Science, Springer-Verlag. Forthcoming. BibTeX, Abstract |
| [2] |
D. Berwanger, E. Grädel, and G. Lenzi, The
variable hierarchy of the mu-calculus is
strict,
Theory of Computing Systems, Selected
Papers from STACS 2005, Springer-Verlag. Forthcoming. BibTeX, Abstract |
| [3] |
D. Berwanger and D. Janin, Automata
on directed graphs: edge versus vertex
marking, in Proceedings of ICGT 2006 -- Graph Transformation, vol. 4178 of LNCS, pp. 46--60, Springer-Verlag, 2006 BibTeX, Abstract |
| [4] |
D. Berwanger, A. Dawar, P. Hunter, S. Kreutzer, DAG-width and parity games, in Proceedings of STACS 2006 -- Symposium on Theoretical Aspects of Computer Science, vol. 3884 of LNCS, pp. 524--436, Springer-Verlag,
2006. BibTeX, Abstract |
| [5] |
D. Berwanger and E. Grädel, Entanglement - A measure for the complexity of
directed graphs with applications to logic and
games., in Proceedings of LPAR 2004 -- International Conference on Logic for Programming and Automated Reasoning, vol. 3452 of LNCS, pp. 209-223, Springer-Verlag,
2005. BibTeX, Abstract |
| [6] |
D. Berwanger and G. Lenzi, The variable hierarchy of the mu-calculus is
strict, in STACS 2005, Proceedings of
the 22nd Symposium on Theoretical Aspects of Computer Science, vol. 3404 of
LNCS, pp. 97-109, Springer-Verlag, 2005. BibTeX, Abstract |
| [7] |
D. Berwanger, Games and logical
expressiveness.
PhD thesis, RWTH Aachen, 2005. BibTeX, Abstract |
| [8] |
D. Berwanger and E. Grädel, Fixed-point logics and solitaire
games. Theory of Computing Systems,
vol. 37, pp. 675-694, 2004. BibTeX, Abstract |
| [9] |
D. Berwanger, Game logic is strong enough for parity
games, Studia Logica, vol. 75, no. 2,
pp. 205-219, 2003.
Special issue on Game Logic and Game Algebra edited by M. Pauly and
R. Parikh. BibTeX, Abstract |
| [10] |
D. Berwanger, E. Grädel, and S. Kreutzer, Once upon a time in the west. Determinacy,
complexity and definability of path games,
in Proceedings of the 10th International Conference on Logic for
Programming and Automated Reasoning, vol. 2850 of LNCS, pp. 226-240,
Springer-Verlag, 2003. BibTeX, Abstract |
| [11] |
D. Berwanger and A. Blumensath, Automata for guarded fixed point
logics, in Automata, Logics, and
Infinite Games (E. Grädel, W. Thomas, and T. Wilke, eds.), no. 2500 in
LNCS, ch. 19, pp. 343-355, Springer Verlag, 2002. BibTeX |
| [12] |
D. Berwanger and E. Grädel, Fixed point formulae and solitaire
games, in Proceedings of the 2nd
International Workshop on Complexity in Automated Deduction, CiAD 2002,
2002. BibTeX, Abstract |
| [13] |
D. Berwanger, E. Grädel, and G. Lenzi, On the variable hierarchy of the modal
mu-calculus, in Computer Science Logic,
CSL 2002 (J. Bradfield, ed.), vol. 2471 of LNCS, pp. 352-366,
Springer-Verlag, 2002. BibTeX, Abstract |
| [14] |
D. Berwanger and A. Blumensath, The monadic theory of tree-like
structures, in Automata, Logics, and
Infinite Games (E. Grädel, W. Thomas, and T. Wilke, eds.), no. 2500 in
LNCS, ch. 16, pp. 285-301, Springer Verlag, 2002. BibTeX |
| [15] |
D. Berwanger and E. Grädel, Games and model checking for guarded
logics, in Proceedings of the 8th
International Conference on Logic for Programming and Automated Reasoning,
LPAR 2001, Havana (R. Nieuwenhuis and A. Voronkov, eds.), vol. 2250 of
LNCS, Springer-Verlag, 2001. BibTeX, Abstract |
I maintain the website of the GAMES Research Training Network and the collection of Open Problems in Finite Model Theory.