References

  1. Benjamin Aminof, Fabio Mogavero & Aniello Murano (2012): Synthesis of Hierarchical Systems. In: Farhad Arbab & Peter Csaba Ölveczky: Formal Aspects of Component Software, Lecture Notes in Computer Science 7253. Springer Berlin Heidelberg, pp. 42–60, doi:10.1007/978-3-642-35743-5_4.
  2. J. Richard Büchi & Lawrence H. Landweber (1969): Solving Sequential Conditions by Finite-State Strategies. Transactions of the American Mathematical Society 138, pp. 295–311, doi:10.2307/1994916.
  3. Roderick Bloem, Stefan Galler, Barbara Jobstmann, Nir Piterman, Amir Pnueli & Martin Weiglhofer (2007): Specify, Compile, Run: Hardware from PSL. Electronic Notes in Theoretical Computer Science 190(4), pp. 3 – 16, doi:10.1016/j.entcs.2007.09.004.
  4. Rüdiger Ehlers (2010): Symbolic Bounded Synthesis. In: Tayssir Touili, Byron Cook & Paul Jackson: Computer Aided Verification, Lecture Notes in Computer Science 6174. Springer Berlin Heidelberg, pp. 365–379, doi:10.1007/978-3-642-14295-6_33.
  5. Marcus Gelderie (2012): Strategy Machines and Their Complexity. In: Branislav Rovan, Vladimiro Sassone & Peter Widmayer: Mathematical Foundations of Computer Science 2012, Lecture Notes in Computer Science 7464. Springer Berlin Heidelberg, pp. 431–442, doi:10.1007/978-3-642-32589-2_39.
  6. Marcus Gelderie & Michael Holtmann (2011): Memory Reduction via Delayed Simulation. In: Johannes Reich & Bernd Finkbeiner: iWIGP, EPTCS 50, pp. 46–60, doi:10.4204/EPTCS.50.4.
  7. Michael Holtmann, Lukasz Kaiser & Wolfgang Thomas (2010): Degrees of Lookahead in Regular Infinite Games. In: Luke Ong: Foundations of Software Science and Computational Structures, Lecture Notes in Computer Science 6014. Springer Berlin Heidelberg, pp. 252–266, doi:10.1007/978-3-642-12032-9_18.
  8. Orna Kupferman & Moshe Y. Vardi (1999): Church's Problem Revisited. The Bulletin of Symbolic Logic 5(2), pp. 245–263, doi:10.2307/421091.
  9. Yoad Lustig & Moshe Y. Vardi (2009): Synthesis from Component Libraries. In: Luca Alfaro: Foundations of Software Science and Computational Structures, Lecture Notes in Computer Science 5504. Springer Berlin Heidelberg, pp. 395–409, doi:10.1007/978-3-642-00596-1_28.
  10. Parthasarathy Madhusudan (2011): Synthesizing Reactive Programs. In: Marc Bezem: Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL, Leibniz International Proceedings in Informatics (LIPIcs) 12. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp. 428–442, doi:10.4230/LIPIcs.CSL.2011.428.
  11. Amir Pnueli & Roni Rosner (1989): On the Synthesis of a Reactive Module. In: POPL, pp. 179–190. Available at http://doi.acm.org/10.1145/75277.75293.
  12. Michael Oser Rabin (1972): Automata on Infinite Objects and Church's Problem. American Mathematical Society, Boston, MA, USA.
  13. Roni Rosner (1992): Modular Synthesis of Reactive Systems. Weizmann Institute of Science.
  14. Sven Schewe & Bernd Finkbeiner (2007): Bounded Synthesis. In: Kedar S. Namjoshi, Tomohiro Yoneda, Teruo Higashino & Yoshio Okamura: Automated Technology for Verification and Analysis, Lecture Notes in Computer Science 4762. Springer Berlin Heidelberg, pp. 474–488, doi:10.1007/978-3-540-75596-8_33.
  15. Wolfgang Thomas (1997): Languages, Automata, and Logic. In: Grzegorz Rozenberg & Arto Salomaa: Handbook of Formal Languages. Springer Berlin Heidelberg, pp. 389–455, doi:10.1007/978-3-642-59126-6_7.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org