References

  1. Roderick Bloem, Krishnendu Chatterjee, Karin Greimel, Thomas A. Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer & Robert Könighofer (2014): Synthesizing robust systems. Acta Inf. 51(3-4), pp. 193–220, doi:10.1007/s00236-013-0191-5.
  2. Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger & Barbara Jobstmann (2009): Better Quality in Synthesis through Quantitative Objectives. In: CAV 2009, LNCS 5643. Springer, pp. 140–156, doi:10.1007/978-3-642-02658-4_14.
  3. Patricia Bouyer, Nicolas Markey, Jörg Olschewski & Michael Ummels (2011): Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited. In: Tevfik Bultan & Pao-Ann Hsiung: ATVA 2011, LNCS 6996. Springer, pp. 135–149, doi:10.1007/978-3-642-24372-1_11.
  4. Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim G. Larsen & Simon Laursen (2016): Average-energy games. Act. Inf., doi:10.1007/s00236-016-0274-1.
  5. Lubos Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini & Jean-François Raskin (2011): Faster algorithms for mean-payoff games. Form. Meth. in Sys. Des. 38(2), pp. 97–118, doi:10.1007/s10703-010-0105-x.
  6. Véronique Bruyère, Emmanuel Filiot, Mickael Randour & Jean-François Raskin (2017): Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games. Inf. Comput. 254, pp. 259–295, doi:10.1016/j.ic.2016.10.011.
  7. Véronique Bruyère, Quentin Hautem & Mickael Randour (2016): Window parity games: an alternative approach toward parity games with time bounds. In: Domenico Cantone & Giorgio Delzanno: GandALF 2016, EPTCS 226, pp. 135–148, doi:10.4204/EPTCS.226.10.
  8. Pavol Cerný, Krishnendu Chatterjee, Thomas A. Henzinger, Arjun Radhakrishna & Rohit Singh (2011): Quantitative Synthesis for Concurrent Programs. In: Ganesh Gopalakrishnan & Shaz Qadeer: CAV 2011, LNCS 6806. Springer, doi:10.1007/978-3-642-22110-1_20.
  9. Krishnendu Chatterjee & Laurent Doyen (2012): Energy parity games. Theo. Comp. Sci. 458, pp. 49–60, doi:10.1016/j.tcs.2012.07.038.
  10. Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger & Jean-François Raskin (2010): Generalized Mean-payoff and Energy Games. In: Kamal Lodaya & Meena Mahajan: FSTTCS, LIPIcs 8, pp. 505–516, doi:10.4230/LIPIcs.FSTTCS.2010.505.
  11. Krishnendu Chatterjee, Thomas A. Henzinger & Florian Horn (2009): Finitary winning in ω-regular games. ACM Trans. Comput. Log. 11(1), doi:10.1145/1614431.1614432.
  12. Krishnendu Chatterjee, Thomas A. Henzinger & Florian Horn (2011): The Complexity of Request-Response Games. In: LATA 2011, LNCS 6638. Springer, pp. 227–237, doi:10.1007/978-3-642-21254-3_17.
  13. Krishnendu Chatterjee, Thomas A. Henzinger & Nir Piterman (2006): Algorithms for Büchi Games. In: GDV. Available at http://arxiv.org/abs/0805.2620.
  14. Eric Dallal, Daniel Neider & Paulo Tabuada (2016): Synthesis of safety controllers robust to unmodeled intermittent disturbances. In: CDC 2016. IEEE, pp. 7425–7430, doi:10.1109/CDC.2016.7799416.
  15. Andrzej Ehrenfeucht & Jan Mycielski (1979): Positional strategies for mean payoff games. Internat. J. Game Theory 8, pp. 109–113, doi:10.1007/BF01768705.
  16. Peter Faymonville & Martin Zimmermann (2017): Parametric Linear Dynamic Logic. Inf. Comput. 253, pp. 237–256, doi:10.1016/j.ic.2016.07.009.
  17. Nathanaël Fijalkow & Martin Zimmermann (2014): Parity and Streett Games with Costs. LMCS 10(2), doi:10.2168/LMCS-10(2:14)2014.
  18. Orna Kupferman, Nir Piterman & Moshe Y. Vardi (2009): From liveness to promptness. Form. Meth. in Sys. Des. 34(2), pp. 83–103, doi:10.1007/s10703-009-0067-z.
  19. Donald A. Martin (1975): Borel determinacy. Ann. of Math. 102, pp. 363–371, doi:10.2307/1971035.
  20. Daniel Neider, Alexander Weinert & Martin Zimmermann (2018): Synthesizing Optimally Resilient Controllers. In: Dan Ghika & Achim Jung: CSL 2018. Schloss Dagstuhl - LZI. To appear.
  21. Anil Nerode, Jeffrey B. Remmel & Alexander Yakhnis (1996): McNaughton Games and Extracting Strategies for Concurrent Programs. Ann. Pure Appl. Logic 78(1-3), pp. 203–242, doi:10.1016/0168-0072(95)00032-1.
  22. Sven Schewe, Alexander Weinert & Martin Zimmermann (2018): Parity Games with Weights. In: Dan Ghika & Achim Jung: CSL 2018. Schloss Dagstuhl - LZI. To appear.
  23. Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Moshe Rabinovich & Jean-François Raskin (2015): The complexity of multi-mean-payoff and multi-energy games. Inf. Comput. 241, pp. 177–196, doi:10.1016/j.ic.2015.03.001.
  24. Nico Wallmeier, Patrick Hütten & Wolfgang Thomas (2003): Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications. In: CIAA 2003, LNCS 2759. Springer, pp. 11–22, doi:10.1007/3-540-45089-0_3.
  25. Alexander Weinert (2017): Quantitative Reductions and Vertex-Ranked Infinite Games. arXiv abs/1704.00904. Available at http://arxiv.org/abs/1704.00904.
  26. Alexander Weinert & Martin Zimmermann (2016): Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. In: Jean-Marc Talbot & Laurent Regnier: CSL 2016, LIPIcs 62, pp. 31:1–31:17, doi:10.4230/LIPIcs.CSL.2016.31.
  27. Uri Zwick & Mike Paterson (1996): The complexity of mean payoff games on graphs. Theo. Comp. Sci. 158(1-2), pp. 343–359, doi:10.1016/0304-3975(95)00188-3.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org