Uniform strategies, rational relations and jumping automata

A general concept of uniform strategies has recently been proposed as a relevant notion in game theory for computer science, which subsumes various notions from the literature. It relies on properties involving sets of plays in two-player turn-based arenas equipped with arbitrary binary relations between plays; these properties are expressed in a language based on CTL * with a quantifier over related plays. There are two semantics for our quantifier, a strict one and a full one, that we study separately. Regarding the strict semantics, the existence of a uniform strategy is undecidable for rational binary relations, but introducing jumping tree automata and restricting attention to recognizable relations allows us to establish a 2-Exptime-complete complexity - and still capture a class of two-player imperfect-information games with epistemic temporal objectives. Regarding the full semantics, relying on information set automata we establish that the existence of a uniform strategy is decidable for rational relations and we provide a nonelementary synthesis procedure. We also exhibit an essentially optimal subclass of rational relations for which the problem becomes 2-Exptime-complete. Considering rich classes of relations makes the theory of uniform strategies powerful: it directly entails various results in logics of knowledge and time, some of them already known, and others new.

[1]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[2]  Thomas Wilke,et al.  Synthesis of Distributed Systems from Knowledge-Based Specifications , 2005, CONCUR.

[3]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

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

[5]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

[6]  Orna Kupferman,et al.  Module Checking Revisited , 1997, CAV.

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

[8]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[9]  Paola Bonizzoni,et al.  On Automata on Infinite Trees , 1992, Theor. Comput. Sci..

[10]  E. Muller David,et al.  Alternating automata on infinite trees , 1987 .

[11]  David E. Muller,et al.  Alternating Automata on Infinite Trees , 1987, Theor. Comput. Sci..

[12]  Sophie Pinchinat,et al.  A General Notion of Uniform Strategies , 2014, IGTR.

[13]  Nicolas Markey,et al.  ATL with Strategy Contexts: Expressiveness and Model Checking , 2010, FSTTCS.

[14]  Sophie Pinchinat,et al.  Jumping Automata for Uniform Strategies , 2013, FSTTCS.

[15]  Krishnendu Chatterjee,et al.  Algorithms for Omega-Regular Games with Imperfect Information , 2006, Log. Methods Comput. Sci..

[16]  Krishnendu Chatterjee,et al.  Strategy construction for parity games with imperfect information , 2010, Inf. Comput..

[17]  Jorge E. Mezei,et al.  On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..

[18]  Ron van der Meyden,et al.  Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract) , 1999, FSTTCS.

[19]  Moshe Y. Vardi,et al.  Synthesis from knowledge-based specifications , 1998 .

[20]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[21]  Catalin Dima,et al.  Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall , 2009, CLIMA.

[22]  J. Reif,et al.  Lower bounds for multiplayer noncooperative games of incomplete information , 2001 .

[23]  Joseph Y. Halpern,et al.  The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds , 1989, J. Comput. Syst. Sci..

[24]  Olivier Carton,et al.  Decision problems among the main subfamilies of rational relations , 2006, RAIRO Theor. Informatics Appl..

[25]  Krzysztof R. Apt,et al.  Lectures in Game Theory for Computer Scientists , 2011 .

[26]  Moshe Y. Vardi.  Verification of Concurrent Programs: The Automata-Theoretic Framework , 1991, Ann. Pure Appl. Log..

[27]  Jacques Sakarovitch,et al.  Synchronized Rational Relations of Finite and Infinite Words , 1993, Theor. Comput. Sci..

[28]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[29]  Bastien Maubert,et al.  Logical foundations of games with imperfect information : uniform strategies. (Fondations logiques des jeux à information imparfaite : stratégies uniformes) , 2014 .

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

[31]  Joseph Y. Halpern,et al.  The complexity of reasoning about knowledge and time , 1986, STOC '86.

[32]  Moshe Y. Vardi,et al.  L O ] 2 4 Ju l 2 01 3 Synthesis from Knowledge-Based Specifications ⋆ , 2014 .

[33]  Guillaume Aucher,et al.  Infinite Games in Epistemic Temporal Logic via Supervisory Control Theory , 2013 .

[34]  Dietmar Berwanger,et al.  On the Power of Imperfect Information , 2008, FSTTCS.

[35]  Johan van Benthem,et al.  The Tree of Knowledge in Action: Towards a Common Perspective , 2006, Advances in Modal Logic.

[36]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[37]  Lukasz Kaiser,et al.  Solving Counter Parity Games , 2012, MFCS.

[38]  Moshe Y. Vardi,et al.  Global Model-Checking of Infinite-State Systems , 2004, CAV.

[39]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[40]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[41]  Mikolaj Bojanczyk,et al.  Two-Way Alternating Automata and Finite Models , 2002, ICALP.

[42]  Bernd Puchala,et al.  Asynchronous Omega-Regular Games with Partial Information , 2010, MFCS.

[43]  Sophie Pinchinat,et al.  Opacity Issues in Games with Imperfect Information , 2011, GandALF.

[44]  Moshe Y. Vardi.  Reasoning about The Past with Two-Way Automata , 1998, ICALP.