Dietmar Berwanger
Address
Mathematische Grundlagen der InformatikRWTH Aachen
D-52056 Aachen
| Phone: | +49-241-80-21715 |
| Fax: | +49-241-80-22215 |
| Room: | 4119 (E1) / Ahornstr. 55 |
| Email: | dwb [AT] logic.rwth-aachen.de |
Research
Logical and algorithmic foundations of interactive systems:
- theory of infinite games
- fixed-point logics, μ-calculus
- verification and synthesis of open systems
- graph structure theory and complexity
Teaching
Mathematical Logic — Winter 2007/08.
Office hours: Monday, 1:30 — 3:30 pm. Other times on request.
Recent Publications
- 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-Verlag, 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-Verlag, 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-Verlag, 2006.
- D. Berwanger. Games and Logical Expressiveness. PhD thesis, RWTH Aachen, 2005.