Bowen Alpern
Fred B. Schneider
1985
Defining liveness
Inf. Process. Lett.
21
4
181–185
10.1016/0020-0190(85)90056-0
Souheib Baarir
Alexandre Duret-Lutz
2015
SAT-Based Minimization of Deterministic ω -Automata
20th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-20)
79–87
10.1007/978-3-662-48899-7_6
Roderick Bloem
Krishnendu Chatterjee
Barbara Jobstmann
2018
Graph Games and Reactive Synthesis
Handbook of Model Checking
Springer International Publishing
Cham
921–962
10.1007/978-3-319-10575-8_27
Roderick Bloem
Rüdiger Ehlers
Robert Könighofer
2015
Cooperative Reactive Synthesis
Bernd Finkbeiner
Geguang Pu
Lijun Zhang
Automated Technology for Verification and Analysis (ATVA)
Lecture Notes in Computer Science
9364
Springer
394–410
10.1007/978-3-319-24953-7_29
Allan Borodin
Ran El-Yaniv
1998
Online computation and competitive analysis
Cambridge University Press
Cambridge, England, UK
Romain Brenguier
Jean-François Raskin
Ocan Sankur
2017
Assume-admissible synthesis
Acta Informatica
54
1
41–83
10.1007/s00236-016-0273-2
Krishnendu Chatterjee
Alexander Kößler
Ulrich Schmid
2020
Automated analysis of real-time scheduling using graph games
Proceedings of the 16th international conference on Hybrid systems: computation and control
163–172
10.1145/2461328.2461356
Rayna Dimitrova
Bernd Finkbeiner
Hazem Torfah
2019
Synthesizing Approximate Implementations for Unrealizable Specifications
Isil Dillig
Serdar Tasiran
Computer Aided Verification
Springer International Publishing
Cham
241–258
10.1007/978-3-030-25540-4_13
Rüdiger Ehlers
2010
Minimising Deterministic Büchi Automata Precisely Using SAT Solving
13th International Conference on Theory and Applications of Satisfiability Testing - (SAT)
326–332
10.1007/978-3-642-14186-7_28
Rüdiger Ehlers
2011
Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis
NASA Formal Methods - Third International Symposium, (NFM)
101–115
10.1007/978-3-642-20398-5_9
Rüdiger Ehlers
Robert Könighofer
Roderick Bloem
2015
Synthesizing cooperative reactive mission plans
2015 IEEE/RSJ International Conference on Intelligent Robots and Systems, (IROS)
3478–3485
10.1109/IROS.2015.7353862
Rüdiger Ehlers
Ufuk Topcu
2014
Resilience to intermittent assumption violations in reactive synthesis
17th International Conference on Hybrid Systems: Computation and Control (HSCC)
203–212
10.1145/2562059.2562128
Paul Hunter
Guillermo A. Pérez
Jean-François Raskin
2017
Reactive synthesis without regret
Acta Informatica
54
1
3–39
10.1007/s00236-016-0268-z
Valerie King
Orna Kupferman
Moshe Y. Vardi
2001
On the Complexity of Parity Word Automata
Foundations of Software Science and Computation Structures, 4th International Conference (FOSSACS)
276–286
10.1007/3-540-45315-6_18
Hadas Kress-Gazit
Morteza Lahijanian
Vasumathi Raman
2018
Synthesis for Robots: Guarantees and Feedback for Robot Behavior
Annu. Rev. Control Rob. Auton. Syst.
1
1
211–236
10.1146/annurev-control-060117-104838
Orna Kupferman
Yoad Lustig
Moshe Vardi
Mihalis Yannakakis
2011
Temporal Synthesis for Bounded Systems and Environments
Symposium on Theoretical Aspects of Computer Science (STACS2011)
9
10.4230/LIPIcs.STACS.2011.615
Rupak Majumdar
Nir Piterman
Anne-Kathrin Schmuck
2019
Environmentally-Friendly GR(1) Synthesis
25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)
229–246
10.1007/978-3-030-17465-1_13
Daniel Neider
2011
Small Strategies for Safety Games
Automated Technology for Verification and Analysis
Springer
Berlin, Germany
306–320
10.1007/978-3-642-24372-1_22
Christos H. Papadimitriou
Mihalis Yannakakis
2020
On complexity as bounded rationality
Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing
726–733
10.1145/195058.195445
Marco Pistore
Moshe Y. Vardi
2007
The Planning Spectrum - One, Two, Three, Infinity
J. Artif. Intell. Res.
30
101–132
10.1613/jair.1909
Sven Schewe
Bernd Finkbeiner
2007
Bounded Synthesis
Kedar S. Namjoshi
Tomohiro Yoneda
Teruo Higashino
Yoshio Okamura
Automated Technology for Verification and Analysis
Springer Berlin Heidelberg
Berlin, Heidelberg
474–488
10.1007/s10009-012-0228-z