In 2014, we proposed Petri games as a model for the synthesis of distributed systems (Actually, we started our research in this direction already in 2009 during a sabbatical in Palo Alto, California, but the first publication appeared in 2014.). Here, we recall the motivation and concepts of Petri games, and provide an overview of what has been achieved in terms of decidability and undecidability of the synthesis problem for Petri games. We also list parameterized benchmark families on which the synthesis algorithms have been evaluated with support of the tool Adam.