Graph Games and Reactive Synthesis
暂无分享,去创建一个
Krishnendu Chatterjee | Roderick Bloem | Barbara Jobstmann | K. Chatterjee | R. Bloem | B. Jobstmann | Barbara Jobstmann
[1] Krishnendu Chatterjee,et al. The complexity of quantitative concurrent parity games , 2006, SODA '06.
[2] Bernd Finkbeiner,et al. Coordination Logic , 2010, CSL.
[3] Edmund M. Clarke,et al. Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.
[4] Catriel Beeri,et al. On the menbership problem for functional and multivalued dependencies in relational databases , 1980, TODS.
[5] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..
[6] Armando Solar-Lezama,et al. Sketching concurrent data structures , 2008, PLDI '08.
[7] Taolue Chen,et al. On Stochastic Games with Multiple Objectives , 2013, MFCS.
[8] Kousha Etessami,et al. Recursive Markov Decision Processes and Recursive Stochastic Games , 2005, ICALP.
[9] I. Walukiewicz. A landscape with games in the background , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..
[10] Andreas Morgenstern,et al. Symbolic controller synthesis for LTL specifications , 2010 .
[11] Amir Pnueli,et al. On the synthesis of a reactive module , 1989, POPL '89.
[12] Amir Pnueli,et al. Temporal Logic and Fair Discrete Systems , 2018, Handbook of Model Checking.
[13] Zohar Manna,et al. Temporal verification of reactive systems - safety , 1995 .
[14] Krishnendu Chatterjee,et al. Hyperplane Separation Technique for Multidimensional Mean-Payoff Games , 2013, CONCUR.
[15] Krishnendu Chatterjee,et al. Mean-payoff parity games , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).
[16] 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).
[17] Krishnendu Chatterjee,et al. Stochastic limit-average games are in EXPTIME , 2008, Int. J. Game Theory.
[18] Krishnendu Chatterjee,et al. Generalized Parity Games , 2007, FoSSaCS.
[19] P. Madhusudan,et al. Control and synthesis of open reactive systems , 2001 .
[20] Roberto Sebastiani,et al. "More Deterministic" vs. "Smaller" Büchi Automata for Efficient LTL Model Checking , 2003, CHARME.
[21] Krishnendu Chatterjee,et al. The Complexity of Stochastic Rabin and Streett Games' , 2005, ICALP.
[22] Kousha Etessami,et al. On the Complexity of Nash Equilibria and Other Fixed Points , 2010, SIAM J. Comput..
[23] Armando Solar-Lezama,et al. Programming by sketching for bit-streaming programs , 2005, PLDI '05.
[24] Krishnendu Chatterjee,et al. Algorithms for Omega-Regular Games with Imperfect Information, , 2006, CSL.
[25] Krishnendu Chatterjee,et al. A survey of partial-observation stochastic parity games , 2012, Formal Methods in System Design.
[26] Vojtech Forejt,et al. Trading Performance for Stability in Markov Decision Processes , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.
[27] Kousha Etessami,et al. Recursive Concurrent Stochastic Games , 2008, Log. Methods Comput. Sci..
[28] P. Ramadge,et al. Supervisory control of a class of discrete event processes , 1987 .
[29] Anne Condon,et al. The Complexity of Stochastic Games , 1992, Inf. Comput..
[30] Kristoffer Arnsfelt Hansen,et al. Exact algorithms for solving stochastic games: extended abstract , 2011, STOC.
[31] Robert McNaughton,et al. Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.
[32] Krishnendu Chatterjee,et al. Energy parity games☆ , 2012, Theoretical Computer Science.
[33] Krishnendu Chatterjee,et al. Environment Assumptions for Synthesis , 2008, CONCUR.
[34] Sven Schewe. Synthesis for Probabilistic Environments , 2006, ATVA.
[35] Roderick Bloem,et al. Finding and fixing faults , 2005, J. Comput. Syst. Sci..
[36] David L. Dill,et al. Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.
[37] Wolfgang Thomas,et al. Languages, Automata, and Logic , 1997, Handbook of Formal Languages.
[38] Fabio Somenzi,et al. Safety first: A two-stage algorithm for LTL games , 2009, 2009 Formal Methods in Computer-Aided Design.
[39] Aniello Murano,et al. On the Boundary of Behavioral Strategies , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.
[40] Roderick Bloem,et al. Parameterized Synthesis , 2012, TACAS.
[41] Bernd Finkbeiner,et al. Synthesis of Asynchronous Systems , 2006, LOPSTR.
[42] Henrik Björklund,et al. A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games , 2007, Discret. Appl. Math..
[43] Krishnendu Chatterjee,et al. The Complexity of Partial-Observation Parity Games , 2010, LPAR.
[44] Igor Walukiewicz. Pushdown Processes: Games and Model-Checking , 2001, Inf. Comput..
[45] Krishnendu Chatterjee,et al. Qualitative concurrent parity games , 2011, TOCL.
[46] Krishnendu Chatterjee,et al. Quantitative stochastic parity games , 2004, SODA '04.
[47] Jean-François Raskin,et al. An Antichain Algorithm for LTL Realizability , 2009, CAV.
[48] L. Brim,et al. Faster algorithms for mean-payoff games , 2011, Formal Methods Syst. Des..
[49] Alexander Moshe Rabinovich,et al. Church Synthesis Problem for Noisy Input , 2011, FoSSaCS.
[50] Thomas A. Henzinger,et al. Synthesizing robust systems , 2009, FMCAD.
[51] Marco Antoniotti,et al. Synthesis and verification of discrete controllers for robotics and manufacturing devices with temporal logic and the control-D system , 1996 .
[52] Donald A. Martin,et al. The determinacy of Blackwell games , 1998, Journal of Symbolic Logic.
[53] A. Ehrenfeucht,et al. Positional strategies for mean payoff games , 1979 .
[54] Rajeev Alur,et al. Deterministic generators and games for Ltl fragments , 2004, TOCL.
[55] Sanjit A. Seshia,et al. Combinatorial sketching for finite programs , 2006, ASPLOS XII.
[56] J. R. Büchi,et al. Solving sequential conditions by finite-state strategies , 1969 .
[57] Krishnendu Chatterjee,et al. Robustness in the Presence of Liveness , 2010, CAV.
[58] Rüdiger Ehlers,et al. Symbolic bounded synthesis , 2010, Formal Methods Syst. Des..
[59] Krishnendu Chatterjee,et al. Multi-objective Discounted Reward Verification in Graphs and MDPs , 2013, LPAR.
[60] Rupak Majumdar,et al. Quantitative solution of omega-regular games , 2004, J. Comput. Syst. Sci..
[61] Krishnendu Chatterjee,et al. Synthesizing Protocols for Digital Contract Signing , 2012, VMCAI.
[62] Joseph Sifakis,et al. On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract) , 1995, STACS.
[63] J. Filar,et al. Competitive Markov Decision Processes , 1996 .
[64] 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.
[65] Igor Walukiewicz,et al. How much memory is needed to win infinite games? , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[66] Bernd Puchala,et al. Asynchronous Omega-Regular Games with Partial Information , 2010, MFCS.
[67] M. Paterson,et al. A deterministic subexponential algorithm for solving parity games , 2006, SODA 2006.
[68] Zohar Manna,et al. The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.
[69] Amir Pnueli,et al. Synthesis of Reactive(1) Designs , 2006, VMCAI.
[70] Pierre Wolper,et al. Reasoning About Infinite Computations , 1994, Inf. Comput..
[71] W. M. Wonham,et al. The control of discrete event systems , 1989 .
[72] Neil Immerman,et al. Number of Quantifiers is Better Than Number of Tape Cells , 1981, J. Comput. Syst. Sci..
[73] Krishnendu Chatterjee,et al. Better Quality in Synthesis through Quantitative Objectives , 2009, CAV.
[74] Margus Veanes,et al. Play to Test , 2005, FATES.
[75] Krishnendu Chatterjee,et al. The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies , 2014, FoSSaCS.
[76] Thomas A. Henzinger,et al. Synthesis of Uninitialized Systems , 2002, ICALP.
[77] Fabio Mogavero. Reasoning About Strategies , 2013, FSTTCS 2013.
[78] Oliver Friedmann,et al. Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs , 2011 .
[79] Krishnendu Chatterjee,et al. Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth , 2015, POPL.
[80] Thomas A. Henzinger,et al. Markov Decision Processes with Multiple Objectives , 2006, STACS.
[81] Marcin Jurdzinski,et al. A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.
[82] Krishnendu Chatterjee,et al. Qualitative Analysis of Partially-Observable Markov Decision Processes , 2009, MFCS.
[83] Paul Gastin,et al. Fast LTL to Büchi Automata Translation , 2001, CAV.
[84] Marcin Jurdziński,et al. Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..
[85] Scott A. Mahlke,et al. The theory of deadlock avoidance via discrete control , 2009, POPL '09.
[86] Krishnendu Chatterjee,et al. A survey of stochastic ω-regular games , 2012, J. Comput. Syst. Sci..
[87] Pierre Wolper,et al. Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, TOPL.
[88] T. Henzinger,et al. Quantitative Synthesis for Concurrent Programs , 2011, CAV.
[89] Krishnendu Chatterjee,et al. Assume-Guarantee Synthesis , 2007, TACAS.
[90] Christos G. Cassandras,et al. Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.
[91] Moshe Y. Vardi. An Automata-Theoretic Approach to Fair Realizability and Synthesis , 1995, CAV.
[92] Larry Joseph Stockmeyer,et al. The complexity of decision problems in automata theory and logic , 1974 .
[93] Sven Schewe,et al. An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games , 2008, CSL.
[94] Krishnendu Chatterjee,et al. Quantitative Interprocedural Analysis , 2015, POPL.
[95] Amir Pnueli,et al. Effective Synthesis of Asynchronous Systems from GR(1) Specifications , 2012, VMCAI.
[96] Kim G. Larsen,et al. Infinite Runs in Weighted Timed Automata with Energy Constraints , 2008, FORMATS.
[97] Zohar Manna,et al. Temporal Verification of Reactive Systems , 1995, Springer New York.
[98] Emanuel Kitzelmann,et al. Inductive Programming: A Survey of Program Synthesis Techniques , 2009, AAIP.
[99] Ruzica Piskac,et al. Complete functional synthesis , 2010, PLDI '10.
[100] Krishnendu Chatterjee,et al. Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.
[101] M. Rabin. Decidability of second-order theories and automata on infinite trees. , 1969 .
[102] Moshe Y. Vardi,et al. Solving Partial-Information Stochastic Parity Games , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.
[103] Krishnendu Chatterjee,et al. The complexity of stochastic Müller games , 2012, Inf. Comput..
[104] Bernd Finkbeiner,et al. Uniform distributed synthesis , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).
[105] Krishnendu Chatterjee,et al. Assume-guarantee synthesis for digital contract signing , 2010, Formal Aspects of Computing.
[106] Orna Kupferman,et al. Safraless Compositional Synthesis , 2006, CAV.
[107] Uri Zwick,et al. The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..
[108] Christel Baier,et al. Controller Synthesis for Probabilistic Systems , 2004, IFIP TCS.
[109] Edmund M. Clarke,et al. Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..
[110] Martín Abadi,et al. Realizable and Unrealizable Specifications of Reactive Systems , 1989, ICALP.
[111] Wolfgang Thomas,et al. On the Synthesis of Strategies in Infinite Games , 1995, STACS.
[112] Fabio Somenzi,et al. Efficient Büchi Automata from LTL Formulae , 2000, CAV.
[113] Amir Pnueli,et al. On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.
[114] Eran Yahav,et al. Abstraction-guided synthesis of synchronization , 2010, POPL.
[115] E. Allen Emerson,et al. Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[116] Hongyang Qu,et al. Quantitative Multi-objective Verification for Probabilistic Systems , 2011, TACAS.
[117] Orna Kupfermant,et al. Synthesis with Incomplete Informatio , 2000 .
[118] Florian Horn. Streett Games on Finite Graphs , 2005 .
[119] John H. Reif,et al. Universal games of incomplete information , 1979, STOC.
[120] Amir Pnueli,et al. Distributed reactive systems are hard to synthesize , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[121] Krishnendu Chatterjee,et al. Partial-Observation Stochastic Games: How to Win When Belief Fails , 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.
[122] E. Allen Emerson,et al. The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[123] Krishnendu Chatterjee,et al. Measuring and Synthesizing Systems in Probabilistic Environments , 2010, J. ACM.
[124] Anne Condon,et al. On Algorithms for Simple Stochastic Games , 1990, Advances In Computational Complexity Theory.
[125] Orna Kupferman,et al. Weak alternating automata and tree automata emptiness , 1998, STOC '98.
[126] M. Maidi. The common fragment of CTL and LTL , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[127] Krishnendu Chatterjee,et al. Stochastic omega-regular games , 2007 .
[128] Roderick Bloem,et al. Optimizations for LTL Synthesis , 2006, 2006 Formal Methods in Computer Aided Design.
[129] Krishnendu Chatterjee,et al. Generalized Mean-payoff and Energy Games , 2010, FSTTCS.
[130] Krishnendu Chatterjee,et al. Efficient Controller Synthesis for Consumption Games with Multiple Resource Types , 2012, CAV.
[131] Thomas A. Henzinger,et al. Interface automata , 2001, ESEC/FSE-9.
[132] Krishnendu Chatterjee,et al. What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives , 2013, CSL.
[133] Klaus Schneider,et al. Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy , 2001, LPAR.
[134] Rastislav Bodík,et al. Algorithmic program synthesis: introduction , 2013, International Journal on Software Tools for Technology Transfer.
[135] Thomas A. Henzinger,et al. The Element of Surprise in Timed Games , 2003, CONCUR.
[136] Marcin Jurdzinski,et al. Small Progress Measures for Solving Parity Games , 2000, STACS.
[137] Doron A. Peled,et al. Synthesizing Solutions to the Leader Election Problem Using Model Checking and Genetic Programming , 2009, Haifa Verification Conference.
[138] Eran Yahav,et al. Inferring Synchronization under Limited Observability , 2009, TACAS.
[139] Thomas A. Henzinger,et al. Detecting Errors Before Reaching Them , 2000, CAV.
[140] Satoru Miyano,et al. Alternating Finite Automata on omega-Words , 1984, CAAP.
[141] Wieslaw Zielonka,et al. Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..
[142] Thomas A. Henzinger,et al. Fair Simulation , 1997, Inf. Comput..
[143] Rüdiger Ehlers,et al. ACTL ∩ LTL Synthesis , 2012, CAV.
[144] Andrzej Wlodzimierz Mostowski,et al. Regular expressions for infinite trees and a standard form of automata , 1984, Symposium on Computation Theory.
[145] Thomas A. Henzinger,et al. Concurrent reachability games , 2007, Theor. Comput. Sci..
[146] Sven Schewe. Solving Parity Games in Big Steps , 2007, FSTTCS.
[147] L. Shapley,et al. Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.
[148] Krishnendu Chatterjee,et al. Randomness for Free , 2010, MFCS.
[149] Krishnendu Chatterjee,et al. Games with secure equilibria , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..
[150] Thomas A. Henzinger,et al. Alternating-time temporal logic , 2002, JACM.
[151] Krishnendu Chatterjee,et al. Strategy synthesis for multi-dimensional quantitative objectives , 2012, Acta Informatica.
[152] Krishnendu Chatterjee,et al. Simple Stochastic Parity Games , 2003, CSL.
[153] Thomas A. Henzinger,et al. Interface Theories for Component-Based Design , 2001, EMSOFT.
[154] Éric Rutten,et al. Automating the addition of fault tolerance with discrete controller synthesis , 2009, Formal Methods Syst. Des..
[155] Kousha Etessami,et al. Multi-Objective Model Checking of Markov Decision Processes , 2007, Log. Methods Comput. Sci..
[156] Krishnendu Chatterjee,et al. Mean-Payoff Pushdown Games , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.
[157] Krishnendu Chatterjee,et al. Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition , 2014, J. ACM.
[158] Kousha Etessami,et al. Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata , 2005, SIAM J. Comput..