L O ] 1 7 D ec 2 01 5 Non-Zero Sum Games for Reactive Synthesis ⋆

In this invited contribution [7], we summarize new solution concepts useful for the synthesis of reactive systems that we have introduced in several recent publications. These solution concepts are developed in the context of non-zero sum games played on graphs. They are part of the contributions obtained in the inVEST project funded by the European Research Council.

[1]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[2]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[3]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[4]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[5]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[6]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[7]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[8]  D. Krass,et al.  Percentile performance criteria for limiting average Markov decision processes , 1995, IEEE Trans. Autom. Control..

[9]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

[10]  Congbin Wu,et al.  Minimizing risk models in Markov decision processes with policies depending on target values , 1999 .

[11]  Krishnendu Chatterjee,et al.  Games with secure equilibria , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[12]  Thomas A. Henzinger,et al.  Solving Games Without Determinization , 2006, CSL.

[13]  Michael Ummels,et al.  Rational Behaviour and Strategy Construction in Infinite Multiplayer Games , 2006, FSTTCS.

[14]  T. Henzinger,et al.  Strategy logic , 2007, Inf. Comput..

[15]  Krishnendu Chatterjee,et al.  Assume-Guarantee Synthesis , 2007, TACAS.

[16]  Dietmar Berwanger,et al.  Admissibility in Infinite Games , 2007, STACS.

[17]  Vladimir Gurvich,et al.  On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction , 2008, Theory of Computing Systems.

[18]  Michael H. Bowling,et al.  Regret Minimization in Games with Incomplete Information , 2007, NIPS.

[19]  Christel Baier,et al.  Principles of model checking , 2008 .

[20]  H. Keisler,et al.  ADMISSIBILITY IN GAMES , 2008 .

[21]  Krishnendu Chatterjee,et al.  Quantitative Languages , 2008, CSL.

[22]  Joseph Y. Halpern,et al.  Iterated Regret Minimization: A New Solution Concept , 2009, IJCAI.

[23]  Marco Faella,et al.  Admissible Strategies in Infinite Games over Graphs , 2009, MFCS.

[24]  Orna Kupferman,et al.  Reasoning about online algorithms with weighted automata , 2009, TALG.

[25]  Jean-François Raskin,et al.  Iterated Regret Minimization in Game Graphs , 2010, MFCS.

[26]  Dana Fisman,et al.  Rational Synthesis , 2009, TACAS.

[27]  L. Brim,et al.  Faster algorithms for mean-payoff games , 2011, Formal Methods Syst. Des..

[28]  Bernd Finkbeiner,et al.  Does It Pay to Extend the Perimeter of a World Model? , 2011, FM.

[29]  John N. Tsitsiklis,et al.  Mean-Variance Optimization in Markov Decision Processes , 2011, ICML.

[30]  Thomas Colcombet.  Forms of Determinism for Automata , 2012, STACS 2012.

[31]  Fabio Mogavero.  Reasoning About Strategies , 2013, FSTTCS 2013.

[32]  Krishnendu Chatterjee,et al.  Trading Performance for Stability in Markov Decision Processes , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[33]  Véronique Bruyère,et al.  Secure equilibria in weighted games , 2014, CSL-LICS.

[34]  Véronique Bruyère,et al.  Expectations or Guarantees? I Want It All! A crossroad between games and MDPs , 2014, SR.

[35]  Rüdiger Ehlers,et al.  How to Handle Assumptions in Synthesis , 2014, SYNT.

[36]  Véronique Bruyère,et al.  Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games , 2013, STACS.

[37]  Jean-François Raskin,et al.  The complexity of admissibility in Omega-regular games , 2013, CSL-LICS.

[38]  Krishnendu Chatterjee,et al.  Looking at mean-payoff and total-payoff through windows , 2015, Inf. Comput..

[39]  Mickael Randour,et al.  Percentile queries in multi-dimensional Markov decision processes , 2014, CAV.

[40]  Lorenzo Clemente,et al.  Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[41]  Véronique Bruyère,et al.  Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability , 2015, CSL.

[42]  Mickael Randour,et al.  Variations on the Stochastic Shortest Path Problem , 2014, VMCAI.

[43]  Jean-François Raskin,et al.  Assume-Admissible Synthesis , 2015, CONCUR.

[44]  Lorenzo Clemente,et al.  Non-Zero Sum Games for Reactive Synthesis , 2015, LATA.

[45]  Giuseppe Perelli,et al.  Synthesis with rational environments , 2016, Annals of Mathematics and Artificial Intelligence.

[46]  Guillermo A. Pérez,et al.  Reactive synthesis without regret , 2016, Acta Informatica.

[47]  Krishnendu Chatterjee,et al.  Doomsday equilibria for omega-regular games , 2017, Inf. Comput..