References

  1. Massimo Benerecetti, Daniele Dell'Erba & Fabio Mogavero (2016): Solving Parity Games via Priority Promotion. In: CAV 2016, LNCS 9780. Springer, pp. 270–290, doi:10.1007/978-3-319-41540-6_15.
  2. Julian C. Bradfield & Igor Walukiewicz (2018): The mu-calculus and Model Checking. In: Handbook of Model Checking. Springer, pp. 871–919, doi:10.1007/978-3-319-10575-8_26.
  3. Florian Bruse, Michael Falk & Martin Lange (2014): The Fixpoint-Iteration Algorithm for Parity Games. In: GandALF, EPTCS 161, pp. 116–130, doi:10.4204/EPTCS.161.12.
  4. Tom van Dijk (2018): Attracting Tangles to Solve Parity Games. In: CAV (2), LNCS 10982. Springer, pp. 198–215, doi:10.1007/978-3-319-96142-2_14.
  5. Tom van Dijk (2018): Oink: An Implementation and Evaluation of Modern Parity Game Solvers. In: TACAS (1), LNCS 10805. Springer, pp. 291–308, doi:10.1007/978-3-319-89960-2_16.
  6. Tom van Dijk (2018): A Parity Game Tale of Two Counters. CoRR abs/1807.10210. Accepted at GandALF 2019..
  7. E. Allen Emerson & Charanjit S. Jutla (1991): Tree Automata, Mu-Calculus and Determinacy (Extended Abstract). In: FOCS. IEEE Computer Society, pp. 368–377, doi:10.1109/SFCS.1991.185392.
  8. E. Allen Emerson, Charanjit S. Jutla & A. Prasad Sistla (2001): On model checking for the mu-calculus and its fragments. Theor. Comput. Sci. 258(1-2), pp. 491–522, doi:10.1016/S0304-3975(00)00034-7.
  9. John Fearnley, Sanjay Jain, Bart de Keijzer, Sven Schewe, Frank Stephan & Dominik Wojtczak (2019): An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space. STTT 21(3), pp. 325–349, doi:10.1007/s10009-019-00509-3.
  10. Oliver Friedmann & Martin Lange (2009): Solving Parity Games in Practice. In: ATVA, LNCS 5799. Springer, pp. 182–196, doi:10.1007/978-3-642-04761-9_15.
  11. Martin Hofmann, Christian Neukirchen & Harald Rueß (2016): Certification for μ-Calculus with Winning Strategies. In: SPIN, Lecture Notes in Computer Science 9641. Springer, pp. 111–128, doi:10.1007/978-3-319-32582-8_8.
  12. Swen Jacobs, Roderick Bloem, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Philipp J. Meyer, Thibaud Michaud, Mouhammad Sakr, Salomon Sickert, Leander Tentrup & Adam Walker (2019): The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results. CoRR abs/1904.07736.
  13. Marcin Jurdzinski (1998): Deciding the Winner in Parity Games is in UP co-UP. Inf. Process. Lett. 68(3), pp. 119–124, doi:10.1016/S0020-0190(98)00150-1.
  14. Marcin Jurdzinski (2000): Small Progress Measures for Solving Parity Games. In: STACS, LNCS 1770. Springer, pp. 290–301, doi:10.1007/3-540-46541-3_24.
  15. Marcin Jurdzinski & Ranko Lazic (2017): Succinct progress measures for solving parity games. In: LICS. IEEE Computer Society, pp. 1–9, doi:10.1109/LICS.2017.8005092.
  16. Jeroen J. A. Keiren (2015): Benchmarks for Parity Games. In: FSEN, LNCS 9392. Springer, pp. 127–142, doi:10.1007/978-3-319-24644-4_9.
  17. Dexter Kozen (1983): Results on the Propositional mu-Calculus. Theor. Comput. Sci. 27, pp. 333–354, doi:10.1016/0304-3975(82)90125-6.
  18. Orna Kupferman & Moshe Y. Vardi (1998): Weak Alternating Automata and Tree Automata Emptiness. In: STOC. ACM, pp. 224–233, doi:10.1145/276698.276748.
  19. Philipp J. Meyer, Salomon Sickert & Michael Luttenberger (2018): Strix: Explicit Reactive Synthesis Strikes Back!. In: CAV (1), Lecture Notes in Computer Science 10981. Springer, pp. 578–586, doi:10.1007/978-3-319-96145-3_31.
  20. Lisette Sanchez, Wieger Wesselink & Tim A. C. Willemse (2018): A Comparison of BDD-Based Parity Game Solvers. In: GandALF, EPTCS 277, pp. 103–117, doi:10.4204/EPTCS.277.8.
  21. Antonio Di Stasio, Aniello Murano, Giuseppe Perelli & Moshe Y. Vardi (2016): Solving Parity Games Using an Automata-Based Algorithm. In: CIAA, LNCS 9705. Springer, pp. 64–76, doi:10.1007/978-3-319-40946-7_6.
  22. Colin Stirling (1995): Local Model Checking Games. In: CONCUR, Lecture Notes in Computer Science 962. Springer, pp. 1–11, doi:10.1007/3-540-60218-6_1.
  23. Maks Verver (2013): Practical improvements to parity game solving. University of Twente.
  24. Igor Walukiewicz (1996): Monadic Second Order Logic on Tree-Like Structures. In: STACS, Lecture Notes in Computer Science 1046. Springer, pp. 401–413, doi:10.1007/3-540-60922-9_33.
  25. 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.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org