Game-based verification and synthesis

[1]  Patricia Bouyer,et al.  Nash equilibria in symmetric graph games with partial observation , 2017, Inf. Comput..

[2]  Krishnendu Chatterjee,et al.  Synthesizing robust systems , 2009, 2009 Formal Methods in Computer-Aided Design.

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

[4]  Andrzej Wlodzimierz Mostowski,et al.  Regular expressions for infinite trees and a standard form of automata , 1984, Symposium on Computation Theory.

[5]  Michael Wooldridge,et al.  ATL Satisfiability is Indeed EXPTIME-complete , 2006, J. Log. Comput..

[6]  Thomas A. Henzinger,et al.  Concurrent reachability games , 2007, Theor. Comput. Sci..

[7]  Thomas A. Henzinger.  Quantitative reactive models , 2012, MODELS'12.

[8]  Tomás Brázdil,et al.  Reachability Games on Extended Vector Addition Systems with States , 2010, ICALP.

[9]  Oliver Friedmann,et al.  An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[10]  Angelika Mader,et al.  Verification of modal properties using Boolean equation systems , 1997 .

[11]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[12]  Fu Song,et al.  Global Model Checking on Pushdown Multi-Agent Systems , 2016, AAAI.

[13]  Nicolas Markey,et al.  ATL with Strategy Contexts and Bounded Memory , 2009, LFCS.

[14]  Krishnendu Chatterjee,et al.  Linear Time Algorithm for Weak Parity Games , 2008, ArXiv.

[15]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[16]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[17]  Kazuhisa Makino,et al.  Parameterized Algorithms for Parity Games , 2015, MFCS.

[18]  Marta Z. Kwiatkowska,et al.  Symmetry Reduction for Probabilistic Model Checking , 2006, CAV.

[19]  Bernd Finkbeiner,et al.  Petri Games: Synthesis of Distributed Systems with Causal Memory , 2014, GandALF.

[20]  Sven Schewe.  Solving Parity Games in Big Steps , 2007, FSTTCS.

[21]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

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

[23]  A. Prasad Sistla,et al.  Symmetry Reductions in Model Checking , 1998, CAV.

[24]  Colin Stirling,et al.  Lokal Model Checking Games , 1995, CONCUR.

[25]  Mariëlle Stoelinga,et al.  An Introduction to Probabilistic Automata , 2002, Bull. EATCS.

[26]  Oliver Friedmann,et al.  Recursive algorithm for parity games requires exponential time , 2011, RAIRO Theor. Informatics Appl..

[27]  Steen Vester.  On the Complexity of Model-Checking Branching and Alternating-Time Temporal Logics in One-Counter Systems , 2015, ATVA.

[28]  Stephan Kreutzer,et al.  DAG-Width and Parity Games , 2006, STACS.

[29]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[30]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[31]  A. Prasad Sistla,et al.  On model checking for the µ-calculus and its fragments , 2001, Theor. Comput. Sci..

[32]  Christof Löding,et al.  Visibly Pushdown Games , 2004, FSTTCS.

[33]  Patricia Bouyer,et al.  Concurrent Games with Ordered Objectives , 2012, FoSSaCS.

[34]  Markus Lohrey,et al.  Branching-Time Model Checking of One-Counter Processes and Timed Automata , 2013, SIAM J. Comput..

[35]  Patricia Bouyer,et al.  Quantitative Verification of Weighted Kripke Structures , 2014, ATVA.

[36]  Joseph Y. Halpern.  The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic , 1995, Artif. Intell..

[37]  Giancarlo Mauri,et al.  Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata , 1977, ICALP.

[38]  Eric van Damme,et al.  Non-Cooperative Games , 2000 .

[39]  Krishnendu Chatterjee,et al.  On Nash Equilibria in Stochastic Games , 2004, CSL.

[40]  Hugo Gimbert,et al.  Probabilistic Automata on Finite Words: Decidable and Undecidable Problems , 2010, ICALP.

[41]  H. W. Kuhn,et al.  11. Extensive Games and the Problem of Information , 1953 .

[42]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

[43]  Jeroen Keiren,et al.  Benchmarks for Parity Games , 2014, FSEN.

[44]  Anca Muscholl,et al.  Automated Synthesis of Distributed Controllers , 2015, ICALP.

[45]  Marta Z. Kwiatkowska,et al.  PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.

[46]  Marcin Jurdziński,et al.  Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..

[47]  Thomas A. Henzinger,et al.  Alternating Refinement Relations , 1998, CONCUR.

[48]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[49]  Valentin Goranko,et al.  How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about Multi-Player Games (Extended Abstract) , 2013, SR.

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

[51]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[52]  Patricia Bouyer,et al.  Mixed Nash Equilibria in Concurrent Games , 2015 .

[53]  Joost-Pieter Katoen,et al.  The How and Why of Interactive Markov Chains , 2009, FMCO.

[54]  A. Prasad Sistla,et al.  Symmetry and model checking , 1993, Formal Methods Syst. Des..

[55]  Joost-Pieter Katoen,et al.  Quantitative Timed Analysis of Interactive Markov Chains , 2012, NASA Formal Methods.

[56]  Nancy A. Lynch,et al.  Switched PIOA: Parallel composition via distributed scheduling , 2006, Theor. Comput. Sci..

[57]  Pedro R. D'Argenio,et al.  Security Analysis in Probabilistic Distributed Protocols via Bounded Reachability , 2012, TGC.

[58]  E. Allen Emerson,et al.  The Beginning of Model Checking: A Personal Perspective , 2008, 25 Years of Model Checking.

[59]  Jan Johannsen,et al.  CTL+ Is Complete for Double Exponential Time , 2003, ICALP.

[60]  Gerd Behrmann,et al.  Adding Symmetry Reduction to Uppaal , 2003, FORMATS.

[61]  Neil Immerman,et al.  The Complexity of Decentralized Control of Markov Decision Processes , 2000, UAI.

[62]  Michael Huth,et al.  Fatal Attractors in Parity Games , 2013, FoSSaCS.

[63]  Aniello Murano,et al.  Pushdown module checking , 2010, Formal Methods Syst. Des..

[64]  Hugo Gimbert,et al.  Games Where You Can Play Optimally Without Any Memory , 2005, CONCUR.

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

[66]  Nicolas Markey,et al.  On the Expressiveness and Complexity of ATL , 2007, FoSSaCS.

[67]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[68]  Valentin Goranko,et al.  Complete axiomatization and decidability of Alternating-time temporal logic , 2006, Theor. Comput. Sci..

[69]  E. Maskin,et al.  The Existence of Equilibrium in Discontinuous Economic Games, I: Theory , 1986 .

[70]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[71]  Michael Huth,et al.  Fatal Attractors in Parity Games: Building Blocks for Partial Solvers , 2014, ArXiv.

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

[73]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[74]  Pierre Wolper,et al.  Reasoning about Infinite Computation Paths (Extended Abstract) , 1983, FOCS 1983.

[75]  Wolfgang Thomas,et al.  Church's Problem and a Tour through Automata Theory , 2008, Pillars of Computer Science.

[76]  Stephan Merz,et al.  Model Checking , 2000 .

[77]  Wolfgang Thomas,et al.  On the Synthesis of Strategies in Infinite Games , 1995, STACS.

[78]  Dominik Wojtczak,et al.  The Complexity of Nash Equilibria in Stochastic Multiplayer Games , 2011, Log. Methods Comput. Sci..

[79]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[80]  Paul Hunter.  Reachability in Succinct One-Counter Games , 2015, RP.

[81]  Amir Pnueli,et al.  On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.

[82]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[83]  Aniello Murano,et al.  Pushdown Multi-Agent System Verification , 2015, IJCAI.

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

[85]  Holger Hermanns,et al.  Distributed Synthesis in Continuous Time , 2016, FoSSaCS.

[86]  Kim G. Larsen,et al.  Infinite Runs in Weighted Timed Automata with Energy Constraints , 2008, FORMATS.

[87]  Johan van Benthem,et al.  Reasoning about Strategies , 2013, Computation, Logic, Games, and Quantum Foundations.

[88]  Laura Bozzelli,et al.  Complexity results on branching-time pushdown model checking , 2006, Theor. Comput. Sci..

[89]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[90]  Amir Pnueli,et al.  Synthesis of Reactive(1) designs , 2006, J. Comput. Syst. Sci..

[91]  Nicolas Markey,et al.  Augmenting ATL with strategy contexts , 2015, Inf. Comput..

[92]  Wojciech Jamroga,et al.  Alternating-time temporal logics with irrevocable strategies , 2007, TARK '07.

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

[94]  Jan Obdrzálek,et al.  Fast Mu-Calculus Model Checking when Tree-Width Is Bounded , 2003, CAV.

[95]  Wojciech Jamroga,et al.  Comparing variants of strategic ability: how uncertainty and memory influence general properties of games , 2014, Autonomous Agents and Multi-Agent Systems.

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

[97]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[98]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[99]  Joël Ouaknine,et al.  Model Checking Succinct and Parametric One-Counter Automata , 2010, ICALP.

[100]  David L. Dill,et al.  Better verification through symmetry , 1996, Formal Methods Syst. Des..

[101]  C. Petri.  Kommunikation mit Automaten , 1962 .

[102]  Krishnendu Chatterjee,et al.  Strategy logic , 2007, Inf. Comput..

[103]  Nancy A. Lynch,et al.  Analyzing Security Protocols Using Time-Bounded Task-PIOAs , 2008, Discret. Event Dyn. Syst..

[104]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[105]  Krishnendu Chatterjee,et al.  Better Quality in Synthesis through Quantitative Objectives , 2009, CAV.

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

[107]  Valentin Goranko,et al.  Optimal Decision Procedures for Satisfiability in Fragments of Alternating-time Temporal Logics , 2014, Advances in Modal Logic.

[108]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[109]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[110]  Stéphane Demri,et al.  The Effects of Bounding Syntactic Resources on Presburger LTL , 2007, 14th International Symposium on Temporal Representation and Reasoning (TIME'07).

[111]  Somesh Jha,et al.  Exploiting symmetry in temporal logic model checking , 1993, Formal Methods Syst. Des..

[112]  P. S. Thiagarajan,et al.  Open Systems in Reactive Environments: Control and Synthesis , 2000, CONCUR.

[113]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[114]  Nir Piterman,et al.  From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[115]  Anca Muscholl,et al.  Asynchronous Games over Tree Architectures , 2012, ICALP.

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

[117]  Aniello Murano,et al.  Reasoning About Strategies: On the Model-Checking Problem , 2011, ArXiv.

[118]  Markus Holzer.  On Emptiness and Counting for Alternating Finite Automata , 1995, Developments in Language Theory.

[119]  Philippe Schnoebelen,et al.  Model Checking a Path , 2003, CONCUR.

[120]  Patricia Bouyer,et al.  Nash Equilibria in Symmetric Games with Partial Observation , 2014, SR.

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

[122]  Bruce Bueno de Mesquita,et al.  An Introduction to Game Theory , 2014 .

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

[124]  Holger Hermanns,et al.  May we reach it? Or must we? In what time? With what probability? , 2011, Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen.

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

[126]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[127]  Govert van Drimmelen,et al.  Satisfiability in Alternating-time Temporal Logic , 2003, LICS.

[128]  Christel Baier,et al.  Probabilistic ω-automata , 2012, JACM.

[129]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[130]  Philippe Schnoebelen,et al.  The Complexity of Propositional Linear Temporal Logics in Simple Cases , 1998, Inf. Comput..

[131]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[132]  Nicolas Markey,et al.  Symmetric Nash Equilibria , 2012 .

[133]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

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

[135]  Azaria Paz,et al.  Introduction to probabilistic automata (Computer science and applied mathematics) , 1971 .

[136]  Petr Jancar,et al.  A note on emptiness for alternating finite automata with a one-letter alphabet , 2007, Inf. Process. Lett..

[137]  Thomas Wahl,et al.  SVISS: Symbolic Verification of Symmetric Systems , 2008, TACAS.

[138]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[139]  Steen Vester.  Winning Cores in Parity Games , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[140]  Oliver Friedmann,et al.  Solving Parity Games in Practice , 2009, ATVA.

[141]  Pedro R. D'Argenio,et al.  Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms , 2014, Theor. Comput. Sci..

[142]  Holger Hermanns,et al.  Compositional Verification and Optimization of Interactive Markov Chains , 2013, CONCUR.

[143]  Valentin Goranko,et al.  Tableau-based decision procedures for logics of strategic ability in multiagent systems , 2008, TOCL.

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

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

[146]  Dénes König,et al.  Theorie der endlichen und unendlichen Graphen : kombinatorische Topologie der Streckenkomplexe , 1935 .

[147]  Joost-Pieter Katoen,et al.  Compositional Abstraction for Stochastic Systems , 2009, FORMATS.

[148]  Stephan Kreutzer,et al.  Graph operations on parity games and polynomial-time algorithms , 2016, Theor. Comput. Sci..

[149]  Tuomas Sandholm,et al.  The State of Solving Large Incomplete-Information Games, and Application to Poker , 2010, AI Mag..

[150]  Uri Zwick,et al.  A deterministic subexponential algorithm for solving parity games , 2006, SODA '06.

[151]  Olivier Serre,et al.  Parity Games Played on Transition Graphs of One-Counter Processes , 2006, FoSSaCS.

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

[153]  Gerard J. Holzmann,et al.  The SPIN Model Checker - primer and reference manual , 2003 .

[154]  Nicolas Markey,et al.  Symmetry Reduction in Infinite Games with Finite Branching , 2014, ATVA.

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

[156]  Joost-Pieter Katoen,et al.  The Ins and Outs of the Probabilistic Model Checker MRMC , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

[157]  Sven Schewe.  ATL* Satisfiability Is 2EXPTIME-Complete , 2008, ICALP.