I am working in the field of automata theory which provides the theoretic foundation for program verification.
In particular, I am interested in games with perfect information (on the configuration graphs of automata). In such games, two players alternate in taking moves on a game arena. The game arena, its current state, and the history of the play is known to both players at each point in time. Real-life example of such games include board games like Chess and Go.
In computer science, these games are used to model systems in which several separate entities influence the behavior. This occurs for example in the context of synthesis, where the goal is to instantiate a program template such that the resulting program satisfies a specification: One player is used to model the choices one has when instantiating the template, the other player models the environment in which the program should be executed.
I am also interested in other topics in automata theory, e.g. in the properties of languages of Petri nets and computational problems related to these languages.