Tree Automata and Discrete Distributed Games

Distributed games, as defined in [6], is a recent multiplayer extension of discrete two player infinite games. The main motivation for their introduction is that they provide an abstract framework for distributed synthesis problems, in which most known decidable cases can be encoded and solved uniformly. In the present paper, we show that this unifying approach allows as well a better understanding of the role played by classical results from tree automata theory (as opposed to adhoc automata constructions) in distributed synthesis problems. More precisely, we use alternating tree automata composition, and simulation of an alternating automaton by a non-deterministic one, as two central tools for giving a simple proof of known decidable cases.