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).