References

  1. Martín Abadi, Leslie Lamport & Pierre Wolper (1989): Realizable and Unrealizable Specifications of Reactive Systems. In: Ausiello, pp. 1–17, doi:10.1007/BFb0035748.
  2. Rajeev Alur, Kousha Etessami, Salvatore La Torre & Doron Peled (2001): Parametric temporal logic for ``model measuring''. ACM Trans. Comput. Log. 2(3), pp. 388–407, doi:10.1145/377978.377990.
  3. Giorgio Ausiello, Mariangiola Dezani-Ciancaglini & Simona Ronchi Della Rocca (1989): ICALP 89. LNCS 372. Springer.
  4. Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Naiyong Jin & Jean-François Raskin (2012): Acacia+, a Tool for LTL Synthesis. In: P. Madhusudan & Sanjit A. Seshia: CAV, LNCS 7358. Springer, pp. 652–657, doi:10.1007/978-3-642-31424-7_45.
  5. Rüdiger Ehlers (2012): Symbolic Bounded Synthesis. Formal Methods in System Design 40(2), pp. 232–262, doi:10.1007/s10703-011-0137-x.
  6. Peter Faymonville, Bernd Finkbeiner, Markus N. Rabe & Leander Tentrup (2015): Encodings of Reactive Synthesis. In: Quantify 2015. Available at http://fmv.jku.at/quantify15/Faymonville-et-al-QUANTIFY2015.pdf.
  7. Peter Faymonville & Martin Zimmermann (2014): Parametric Linear Dynamic Logic. In: Adriano Peron & Carla Piazza: GandALF, EPTCS 161, pp. 60–73, doi:10.4204/EPTCS.161.8.
  8. Emmanuel Filiot, Naiyong Jin & Jean-François Raskin (2011): Antichains and compositional algorithms for LTL synthesis. Formal Methods in System Design 39(3), pp. 261–296, doi:10.1007/s10703-011-0115-3.
  9. Bernd Finkbeiner & Sven Schewe (2013): Bounded synthesis. STTT 15(5-6), pp. 519–539, doi:10.1007/s10009-012-0228-z.
  10. Erich Grädel, Wolfgang Thomas & Thomas Wilke (2002): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS 2500. Springer.
  11. Barbara Jobstmann & Roderick Bloem (2006): Optimizations for LTL Synthesis. In: FMCAD. IEEE Computer Society, pp. 117–124, doi:10.1109/FMCAD.2006.22.
  12. Orna Kupferman, Nir Piterman & Moshe Y. Vardi (2006): Safraless Compositional Synthesis. In: Thomas Ball & Robert B. Jones: CAV, LNCS 4144. Springer, pp. 31–44, doi:10.1007/11817963_6.
  13. Orna Kupferman, Nir Piterman & Moshe Y. Vardi (2009): From liveness to promptness. Formal Methods in System Design 34(2), pp. 83–103, doi:10.1007/s10703-009-0067-z.
  14. Orna Kupferman & Moshe Y. Vardi (2005): Safraless Decision Procedures. In: FOCS. IEEE Computer Society, pp. 531–542, doi:10.1109/SFCS.2005.66.
  15. Amir Pnueli (1977): The Temporal Logic of Programs. In: FOCS 1977. IEEE Computer Society, pp. 46–57, doi:10.1109/SFCS.1977.32.
  16. Amir Pnueli & Roni Rosner (1989): On the Synthesis of a Reactive Module. In: POPL, pp. 179–190, doi:10.1145/75277.75293.
  17. Amir Pnueli & Roni Rosner (1989): On the Synthesis of an Asynchronous Reactive Module. In: Ausiello, pp. 652–671, doi:10.1007/BFb0035790.
  18. Sven Schewe (2007): Solving Parity Games in Big Steps. In: Vikraman Arvind & Sanjiva Prasad: FSTTCS 2007, LNCS 4855. Springer, pp. 449–460, doi:10.1007/978-3-540-77050-3_37.
  19. Martin Zimmermann (2013): Optimal bounds in parametric LTL games. Theor. Comput. Sci. 493, pp. 30–45, doi:10.1016/j.tcs.2012.07.039.
  20. Martin Zimmermann (2015): Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL. In: Javier Esparza & Enrico Tronci: GandALF 2015, EPTCS 193, pp. 144–157, doi:10.4204/EPTCS.193.11.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org