A Retraction Theorem for Distributed Synthesis

We present a general theorem for distributed synthesis problems in coordination games with $\omega$-regular objectives of the form: If there exists a winning strategy for the coalition, then there exists an "essential" winning strategy, that is obtained by a retraction of the given one. In general, this does not lead to finite-state winning strategies, but when the knowledge of agents remains bounded, we can solve the synthesis problem. Our study is carried out in a setting where objectives are expressed in terms of events that may \emph{not} be observable. This is natural in games of imperfect information, rather than the common assumption that objectives are expressed in terms of events that are observable to all agents. We characterise decidable distributed synthesis problems in terms of finiteness of knowledge states and finite congruence classes induced by them.

[1]  M. Rabin.  Automata on Infinite Objects and Church's Problem , 1972 .

[2]  E. Emerson,et al.  Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) , 1991, FOCS 1991.

[3]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[4]  O. Kupermann,et al.  Synthesizing distributed systems , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[5]  Dietmar Berwanger,et al.  Hierarchical Information Patterns and Distributed Strategy Synthesis , 2015, ATVA.

[6]  Paul Gastin,et al.  Distributed Games and Distributed Control for Asynchronous Systems , 2004, LATIN.

[7]  Lukasz Kaiser,et al.  Information Tracking in Games on Graphs , 2010, J. Log. Lang. Inf..

[8]  Robert McNaughton,et al.  Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..

[9]  Wolfgang Thomas,et al.  Facets of Synthesis: Revisiting Church's Problem , 2009, FoSSaCS.

[10]  John H. Reif,et al.  The Complexity of Two-Player Games of Incomplete Information , 1984, J. Comput. Syst. Sci..

[11]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

[12]  Ramaswamy Ramanujam,et al.  A Communication Based Model for Games of Imperfect Information , 2010, CONCUR.

[13]  Nils Klarlund,et al.  Rabin Measures , 1995, Chic. J. Theor. Comput. Sci..

[14]  Amir Pnueli,et al.  Distributed reactive systems are hard to synthesize , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[15]  P. S. Thiagarajan,et al.  A Decidable Class of Asynchronous Distributed Controllers , 2002, CONCUR.

[16]  Orna Kupferman,et al.  Synthesizing Distributed Systems , 2001, LICS.

[17]  Lukasz Kaiser,et al.  A Perfect-Information Construction for Coordination in Games , 2011, FSTTCS.

[18]  Nils Klarlund,et al.  Progress measures, immediate determinacy, and a subset construction for tree automata , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[19]  Dietmar Berwanger,et al.  Infinite games with finite knowledge gaps , 2014, Inf. Comput..

[20]  David Janin,et al.  On the (High) Undecidability of Distributed Synthesis Problems , 2007, SOFSEM.

[21]  Bernd Finkbeiner,et al.  Uniform distributed synthesis , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[22]  Igor Walukiewicz,et al.  Positional Determinacy of Games with Infinitely Many Priorities , 2006, Log. Methods Comput. Sci..

[23]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[24]  Jean-François Raskin,et al.  Games with imperfect information: theory and algorithms , 2011, Lectures in Game Theory for Computer Scientists.

[25]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.

[26]  John H. Reif,et al.  Multiple-person alternation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[27]  Igor Walukiewicz,et al.  Distributed Games , 2003, FSTTCS.

[28]  N. Klarlund.  Progress Measures and Finite Arguments for Infinite Computations , 1990 .

[29]  Dietmar Berwanger,et al.  Automata on Directed Graphs: Edge Versus Vertex Marking , 2006, ICGT.

[30]  Anca Muscholl,et al.  Distributed Synthesis for Acyclic Architectures , 2014, FSTTCS.

[31]  Christof Löding,et al.  Choice functions and well-orderings over the infinite binary tree , 2010 .

[32]  Thomas A. Henzinger,et al.  Games in system design and verification , 2005, TARK.