References

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

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