Mingshuai Chen, Martin Fränzle, Yangjia Li, Peter Nazier Mosaad & Naijun Zhan (2018):
What's to Come is Still Unsure - Synthesizing Controllers Resilient to Delayed Interaction.
In: Shuvendu K. Lahiri & Chao Wang: Automated Technology for Verification and Analysis - 16th International Symposium, ATVA 2018, Los Angeles, CA, USA, October 7-10, 2018, Proceedings,
Lecture Notes in Computer Science 11138.
Springer,
pp. 56–74,
doi:10.1007/978-3-030-01090-4_4.
Available at https://moves.rwth-aachen.de/wp-content/uploads/ATVA2018_FULL.pdf.
Alonso Church (1957):
Applications of recursive arithmetic to the problem of circuit synthesis.
In: Summaries of the Summer Institute of Symbolic Logic.
Cornell Univ., Ithaca, NY,
pp. 3–50,
doi:10.2307/2271310.
Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari & Stefano Tonetta (2020):
Reactive Synthesis from Extended Bounded Response LTL Specifications.
In: 2020 Formal Methods in Computer Aided Design, FMCAD 2020, Haifa, Israel, September 21-24, 2020.
IEEE,
pp. 83–92,
doi:10.34727/2020/ISBN.978-3-85448-042-6_15.
Rüdiger Ehlers (2010):
Symbolic Bounded Synthesis.
In: Tayssir Touili, Byron Cook & Paul B. Jackson: Computer Aided Verification, 22nd International Conference, CAV 2010, Edinburgh, UK, July 15-19, 2010. Proceedings,
Lecture Notes in Computer Science 6174.
Springer,
pp. 365–379,
doi:10.1007/978-3-642-14295-6_33.
Emmanuel Filiot, Naiyong Jin & Jean-François Raskin (2009):
An Antichain Algorithm for LTL Realizability.
In: Ahmed Bouajjani & Oded Maler: Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings,
Lecture Notes in Computer Science 5643.
Springer,
pp. 263–277,
doi:10.1007/978-3-642-02658-4_22.
Emmanuel Filiot, Naiyong Jin & Jean-François Raskin (2011):
Antichains and compositional algorithms for LTL synthesis.
Formal Methods Syst. Des. 39(3),
pp. 261–296,
doi:10.1007/S10703-011-0115-3.
Bernd Finkbeiner (2016):
Synthesis of Reactive Systems.
In: Javier Esparza, Orna Grumberg & Salomon Sickert: Dependable Software Systems Engineering,
NATO Science for Peace and Security Series - D: Information and Communication Security 45.
IOS Press,
pp. 72–98,
doi:10.3233/978-1-61499-627-9-72.
Available at https://finkbeiner.groups.cispa.de/publications/F16.pdf.
Bernd Finkbeiner & Swen Jacobs (2012):
Lazy Synthesis.
In: Viktor Kuncak & Andrey Rybalchenko: Verification, Model Checking, and Abstract Interpretation - 13th International Conference, VMCAI 2012, Philadelphia, PA, USA, January 22-24, 2012. Proceedings,
Lecture Notes in Computer Science 7148.
Springer,
pp. 219–234,
doi:10.1007/978-3-642-27940-9_15.
Available at https://finkbeiner.groups.cispa.de/publications/lazySynthesis.pdf.
Marcin Jurdzinski (2000):
Small Progress Measures for Solving Parity Games.
In: Horst Reichel & Sophie Tison: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings,
Lecture Notes in Computer Science 1770.
Springer,
pp. 290–301,
doi:10.1007/3-540-46541-3_24.
Available at https://www.dcs.warwick.ac.uk/~mju/Papers/Jur00-STACS.pdf.
Orna Kupferman & Moshe Y. Vardi (2005):
Safraless Decision Procedures.
In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings.
IEEE Computer Society,
pp. 531–542,
doi:10.1109/SFCS.2005.66.
Oded Maler, Dejan Nickovic & Amir Pnueli (2007):
On Synthesizing Controllers from Bounded-Response Properties.
In: Werner Damm & Holger Hermanns: Computer Aided Verification, 19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007, Proceedings,
Lecture Notes in Computer Science 4590.
Springer,
pp. 95–107,
doi:10.1007/978-3-540-73368-3_12.
Robert McNaughton (1993):
Infinite Games Played on Finite Graphs.
Ann. Pure Appl. Logic 65(2),
pp. 149–184,
doi:10.1016/0168-0072(93)90036-D.
Kostas Patroumpas & Timos K. Sellis (2006):
Window Specification over Data Streams.
In: Torsten Grust, Hagen Höpfner, Arantza Illarramendi, Stefan Jablonski, Marco Mesiti, Sascha Müller, Paula-Lavinia Patranjan, Kai-Uwe Sattler, Myra Spiliopoulou & Jef Wijsen: Current Trends in Database Technology - EDBT 2006, EDBT 2006 Workshops PhD, DataX, IIDB, IIHA, ICSNW, QLQP, PIM, PaRMA, and Reactivity on the Web, Munich, Germany, March 26-31, 2006, Revised Selected Papers,
Lecture Notes in Computer Science 4254.
Springer,
pp. 445–464,
doi:10.1007/11896548_35.
Available at https://dl.ifip.org/db/conf/edbtw/edbtw2006/PatroumpasS06.pdf.
Nir Piterman, Amir Pnueli & Yaniv Sa'ar (2006):
Synthesis of Reactive(1) Designs.
In: E. Allen Emerson & Kedar S. Namjoshi: Verification, Model Checking, and Abstract Interpretation, 7th International Conference, VMCAI 2006, Charleston, SC, USA, January 8-10, 2006, Proceedings,
Lecture Notes in Computer Science 3855.
Springer,
pp. 364–380,
doi:10.1007/11609773_24.
Available at https://www.wisdom.weizmann.ac.il/~saar/data/synth.pdf.
Amir Pnueli & Roni Rosner (1989):
On the Synthesis of an Asynchronous Reactive Module.
In: Giorgio Ausiello, Mariangiola Dezani-Ciancaglini & Simona Ronchi Della Rocca: Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings,
Lecture Notes in Computer Science 372.
Springer,
pp. 652–671,
doi:10.1007/BFB0035790.
Sven Schewe & Bernd Finkbeiner (2007):
Bounded Synthesis.
In: Kedar S. Namjoshi, Tomohiro Yoneda, Teruo Higashino & Yoshio Okamura: Automated Technology for Verification and Analysis, 5th International Symposium, ATVA 2007, Tokyo, Japan, October 22-25, 2007, Proceedings,
Lecture Notes in Computer Science 4762.
Springer,
pp. 474–488,
doi:10.1007/978-3-540-75596-8_33.
Available at https://link.springer.com/content/pdf/10.1007/s10009-012-0228-z.pdf.
Larry J. Stockmeyer (1974):
The complexity of decision problems in automata theory and logic.
Massachusetts Institute of Technology, USA.
Available at http://hdl.handle.net/1721.1/15540.
Wolfgang Thomas (1995):
On the Synthesis of Strategies in Infinite Games.
In: Ernst W. Mayr & Claude Puech: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings,
Lecture Notes in Computer Science 900.
Springer,
pp. 1–13,
doi:10.1007/3-540-59042-0_57.
Wolfgang Thomas (2009):
Facets of Synthesis: Revisiting Church's Problem.
In: Luca de Alfaro: Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings,
Lecture Notes in Computer Science 5504.
Springer,
pp. 1–14,
doi:10.1007/978-3-642-00596-1_1.
Shufang Zhu, Lucas M. Tabajara, Jianwen Li, Geguang Pu & Moshe Y. Vardi (2017):
A Symbolic Approach to Safety LTL Synthesis.
In: Ofer Strichman & Rachel Tzoref-Brill: Hardware and Software: Verification and Testing - 13th International Haifa Verification Conference, HVC 2017, Haifa, Israel, November 13-15, 2017, Proceedings,
Lecture Notes in Computer Science 10629.
Springer,
pp. 147–162,
doi:10.1007/978-3-319-70389-3_10.
Available at https://arxiv.org/abs/1709.07495.
Wieslaw Zielonka (1998):
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees.
Theor. Comput. Sci. 200(1-2),
pp. 135–183,
doi:10.1016/S0304-3975(98)00009-7.