Strategy logic

[1]  Christel Baier,et al.  Stochastic game logic , 2007, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007).

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

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

[4]  Lukasz Kaiser.  Game Quantification on Automatic Structures and Hierarchical Model Checking Games , 2006, CSL.

[5]  Krishnendu Chatterjee,et al.  Semiperfect-Information Games , 2005, FSTTCS.

[6]  Orna Kupferman,et al.  Safraless decision procedures , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[7]  Margus Veanes,et al.  Play to Test , 2005, FATES.

[8]  Krishnendu Chatterjee,et al.  The Complexity of Stochastic Rabin and Streett Games' , 2005, ICALP.

[9]  Geert Jonker,et al.  On Epistemic Temporal Strategic Logic , 2005, LCMAS.

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

[11]  Krishnendu Chatterjee,et al.  Quantitative stochastic parity games , 2004, SODA '04.

[12]  Thomas A. Henzinger,et al.  Interface automata , 2001, ESEC/FSE-9.

[13]  Orna Kupferman,et al.  Module Checking , 1996, Inf. Comput..

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

[15]  L. Staiger.  Languages , 1997, Practice and Procedure of the International Criminal Tribunal for the Former Yugoslavia.

[16]  Orna Kupfermant,et al.  Synthesis with Incomplete Informatio , 2000 .

[17]  Thomas A. Henzinger,et al.  Concurrent reachability games , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[18]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[19]  Thomas A. Henzinger,et al.  Fair Simulation , 1997, Inf. Comput..

[20]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

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

[22]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[23]  A. Prasad Sistla,et al.  On Model-Checking for Fragments of µ-Calculus , 1993, CAV.

[24]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[25]  Jana Kosecka,et al.  Control of Discrete Event Systems , 1992 .

[26]  David L. Dill,et al.  Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.

[27]  Martín Abadi,et al.  Realizable and Unrealizable Specifications of Reactive Systems , 1989, ICALP.

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

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

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

[31]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[32]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[33]  Robin Milner,et al.  An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

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

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