Antonio Casares, PhD student supervised by Igor Walukiewicz and Nathanaël Fijalkow won the best student paper award at the CSL (Computer Science in Logic) conference.
The aim is to study two models that are essential in the theoretical study of non-terminating processes: automata on infinite words and infinite duration games.
This work has contributed to find a strong relationship between these two models: we identify a type of automata that exactly characterizes the complexity of winning strategies for a class of games.