References

  1. L. de Alfaro & M. Faella (2007): An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games. In: CAV, LNCS 4590. Springer, pp. 108–120, doi:10.1007/978-3-540-73368-3_13.
  2. A. Arnold, A. Vincent & I. Walukiewicz (2003): Games for Synthesis of Controllers with Partial Observation. TCS 303(1), pp. 7–34, doi:10.1016/S0304-3975(02)00442-5.
  3. M. Bakera, S. Edelkamp, P. Kissmann & C.D. Renner (2008): Solving μ-Calculus Parity Games by Symbolic Planning. In: MoChArt, LNCS 5348. Springer, pp. 15–33, doi:10.1007/978-3-642-00431-5_2.
  4. M. Benerecetti, D. Dell'Erba & F. Mogavero (2016): A Delayed Promotion Policy for Parity Games. In: GandALF, EPTCS 226, pp. 30–45, doi:10.4204/EPTCS.226.3.
  5. M. Benerecetti, D. Dell'Erba & F. Mogavero (2016): Improving Priority Promotion for Parity Games. In: Haifa Verification Conference, LNCS 10028, pp. 117–133, doi:10.1007/978-3-319-49052-6_8.
  6. M. Benerecetti, D. Dell'Erba & F. Mogavero (2016): Solving Parity Games via Priority Promotion. In: CAV (2), LNCS 9780. Springer, pp. 270–290, doi:10.1007/978-3-319-41540-6_15.
  7. D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen & T.A. Henzinger (2009): Alpaga: A Tool for Solving Parity Games with Imperfect Information. In: TACAS, LNCS 5505. Springer, pp. 58–61, doi:10.1007/978-3-642-00768-2_7.
  8. F. Bruse, M. Falk & M. Lange (2014): The Fixpoint-Iteration Algorithm for Parity Games. In: GandALF, EPTCS 161, pp. 116–130. Available at https://doi.org/10.4204/EPTCS.161.12.
  9. D. Bustan, O. Kupferman & M.Y. Vardi (2004): A Measured Collapse of the Modal μ-Calculus Alternation Hierarchy. In: STACS, LNCS 2996. Springer, pp. 522–533, doi:10.1007/978-3-540-24749-4_46.
  10. C.S. Calude, S. Jain, B. Khoussainov, W. Li & F. Stephan (2017): Deciding Parity Games in Quasipolynomial Time. In: STOC. ACM, pp. 252–263, doi:10.1145/3055399.3055409.
  11. K. Chatterjee, W. Dvorák, M. Henzinger & V. Loitzenbauer (2017): Improved Set-Based Symbolic Algorithms for Parity Games. In: CSL, LIPIcs 82. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 18:1–18:21, doi:10.4230/LIPIcs.CSL.2017.18.
  12. T. Chen, B. Ploeger, J. van de Pol & T.A.C. Willemse (2007): Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems. In: CONCUR'07, pp. 120–135, doi:10.1007/978-3-540-74407-8_9.
  13. S. Cranen, J.F. Groote, J.J.A. Keiren, F. Stappers, E.P. de Vink, W. Wesselink & T.A.C. Willemse (2013): An Overview of the mCRL2 Toolset and Its Recent Advances. In: TACAS, LNCS 7795. Springer, pp. 199–213, doi:10.1007/978-3-642-36742-7_15.
  14. T. 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.
  15. R. Drechsler & B. Becker (1998): Binary Decision Diagrams - Theory and Implementation. Springer, doi:10.1007/978-1-4757-2892-7.
  16. E.A. Emerson & C.S. Jutla (1991): Tree automata, Mu-Calculus and determinacy. In: FOCS'91. IEEE Computer Society, Washington, DC, USA, pp. 368–377, doi:10.1109/SFCS.1991.185392.
  17. J. Fearnley, S. Jain, S. Schewe, F. Stephan & D. Wojtczak (2017): An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space. In: SPIN. ACM, pp. 112–121, doi:10.1145/3092282.3092286.
  18. O. Friedmann & M. Lange (2009): Solving Parity Games in Practice. In: ATVA, LNCS 5799. Springer, pp. 182–196, doi:10.1007/978-3-642-04761-9_15.
  19. M. Gazda & T.A.C. Willemse (2013): Zielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds. In: GandALF, EPTCS 119, pp. 7–20, doi:10.4204/EPTCS.119.4.
  20. J.F. Groote & T.A.C. Willemse (2005): Parameterised Boolean Equation Systems. Theor. Comput. Sci. 343(3), pp. 332–369, doi:10.1016/j.tcs.2005.06.016.
  21. M. Jurdziński (2000): Small Progress Measures for Solving Parity Games. In: STACS'00, LNCS 1770. Springer, pp. 290–301, doi:10.1007/3-540-46541-3_24.
  22. M. Jurdziński & R. Lazic (2017): Succinct Progress Measures for Solving Parity Games. In: LICS. IEEE Computer Society, pp. 1–9, doi:10.1109/LICS.2017.8005092.
  23. G. Kant & J. van de Pol (2014): Generating and Solving Symbolic Parity Games. In: GRAPHITE, EPTCS 159, pp. 2–14, doi:10.4204/EPTCS.159.2.
  24. J.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.
  25. O. Kupferman & M.Y. Vardi (1998): Weak Alternating Automata and Tree Automata Emptiness. In: STOC. ACM, pp. 224–233, doi:10.1145/276698.276748.
  26. R. McNaughton (1993): Infinite Games Played on Finite Graphs. APAL 65(2), pp. 149–184, doi:10.1016/0168-0072(93)90036-D.
  27. H. Seidl (1996): Fast and Simple Nested Fixpoints. Inf. Process. Lett. 59(6), pp. 303–308, doi:10.1016/0020-0190(96)00130-5.
  28. A. Di Stasio, A. Murano, G. Perelli & M.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.
  29. I. Wegener (2000): Branching programs and binary decision diagrams. SIAM, doi:10.1137/1.9780898719789.
  30. W. Zielonka (1998): Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees. TCS 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