Institute of

Theoretical Computer Science


Technische Universität Braunschweig

Sebastian Muskalla

PhD Student

M.Sc. in Mathematics

Phone: +49 (0)531 391 9520
Office: IZ 370, i.e. Informatikzentrum, 3rd floor, office 370,
Mühlenpfordtstr. 23, 38106 Braunschweig,
Mail: Sebastian Muskalla
Institut für Theoretische Informatik
Mühlenpfordtstr. 23
38106 Braunschweig
Links: List of Publications

I am a PhD student, researcher and teaching assistant („wissenschaftlicher Mitarbeiter“) under the supervision of Prof. Roland Meyer at the Institute for Theoretical Computer Science at TU Braunschweig since October 2016. Before our move to Braunschweig, I was a PhD student in Prof. Meyer's Concurrency Theory Group at TU Kaiserslautern from May 2015 on. From 2009 to 2015, I studied mathematics with a minor in computer science at TU Kaiserslautern.


I am mostly working on games with perfect information, two player games in which the full state of the game is visible to both players. Real life example of such games include many board games like chess and Go. In computer science, these games are used to model systems in which several separate entities can influence the behavior of the system.

In our paper Summaries for context-free games, we have introduced an efficient, summary-based algorithm for solving reachability games on the infinite graph of sentential forms of a context-free grammar. We have extended this approach to more involved settings, namely to to games defined by higher-order recursion schemes in Domains for higher-order games. and to infinite words generated by context-free grammars in Liveness verification and synthesis: New algorithms for recursive programs,

In our algorithm, the crucial step is finding the least solution of a system of equations over a lattice. Therefore, I am also interested in algorithms to solve such systems of equations in general. In our paper Munchausen iteration, we have introduced a symbolic variant of Newton iteration for semirings.

I am also interested in other topics in the field of automata theory, e.g. in decision problem for Petri nets (see our paper On the upward/downward closures of Petri nets).


Lectures & exercise classes

Supervised theses

Lecture notes

Other activities


I have reviewed submissions for:


I have attended or will attend the following events, workshops, and conferences: