References

  1. Marco Bakera, Stefan Edelkamp, Peter Kissmann & Clemens D. Renner (2008): Solving μ-Calculus Parity Games by Symbolic Planning. In: MoChArt, Lecture Notes in Computer Science 5348. Springer, pp. 15–33, doi:10.1007/978-3-540-92221-6.
  2. Massimo Benerecetti, Daniele Dell'Erba & Fabio Mogavero (2018): Solving parity games via priority promotion. Formal Methods Syst. Des. 52(2), pp. 193–226, doi:10.1016/0304-3975(95)00188-3.
  3. George Boole (1854): An investigation of the laws of thought: on which are founded the mathematical theories of logic and probabilities 2. Walton and Maberly.
  4. 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.
  5. Randal E. Bryant (1992): Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Comput. Surv. 24(3), pp. 293–318, doi:10.1145/42282.46161.
  6. Jerry R. Burch, Edmund M. Clarke, Kenneth L. McMillan, David L. Dill & L. J. Hwang (1992): Symbolic Model Checking: 10^20 States and Beyond. Inf. Comput. 98(2), pp. 142–170, doi:10.1016/0890-5401(92)90017-A.
  7. Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li & Frank Stephan (2017): Deciding parity games in quasipolynomial time. In: STOC. ACM, pp. 252–263, doi:10.1145/3055399.3055409.
  8. Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger & Alexander Svozil (2018): Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. In: LPAR, EPiC Series in Computing 57. EasyChair, pp. 233–253, doi:10.29007/5z5k.
  9. Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic & Pawel Parys (2019): Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. In: SODA. SIAM, pp. 2333–2349, doi:10.1137/1.9781611975482.142.
  10. Tom van Dijk (2018): Attracting Tangles to Solve Parity Games. In: CAV (2), Lecture Notes in Computer Science 10982. Springer, pp. 198–215, doi:10.1007/978-3-319-96142-2_14.
  11. Tom van Dijk (2018): Oink: An Implementation and Evaluation of Modern Parity Game Solvers. In: TACAS (1), Lecture Notes in Computer Science 10805. Springer, pp. 291–308, doi:10.1016/S0304-3975(98)00009-7.
  12. Tom van Dijk & Jaco van de Pol (2017): Sylvan: multi-core framework for decision diagrams. Int. J. Softw. Tools Technol. Transf. 19(6), pp. 675–696, doi:10.1007/s10009-016-0433-2.
  13. Tom van Dijk & Bob Rubbens (2019): Simple Fixpoint Iteration To Solve Parity Games. In: GandALF, EPTCS 305, pp. 123–139, doi:10.4204/EPTCS.305.9.
  14. Rolf Drechsler & Bernd Becker (1998): Binary Decision Diagrams - Theory and Implementation. Springer, doi:10.1007/978-1-4757-2892-7.
  15. Rolf Drechsler & Detlef Sieling (2001): Binary decision diagrams in theory and practice. Int. J. Softw. Tools Technol. Transf. 3(2), pp. 112–136, doi:10.1007/s100090100056.
  16. 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.
  17. 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. Int. J. Softw. Tools Technol. Transf. 21(3), pp. 325–349, doi:10.1016/S0304-3975(98)00009-7.
  18. Oliver Friedmann & Martin Lange (2009): The PGSolver collection of parity game solvers. University of Munich, pp. 4–6.
  19. Swen Jacobs, Nicolas Basset, Roderick Bloem, Romain Brenguier, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Thibaud Michaud, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur & Leander Tentrup (2017): The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results. In: SYNT@CAV, EPTCS 260, pp. 116–143, doi:10.4204/EPTCS.260.10.
  20. Marcin Jurdzinski (1998): Deciding the Winner in Parity Games is in UP \ cap co-Up. Inf. Process. Lett. 68(3), pp. 119–124, doi:10.1016/S0020-0190(98)00150-1.
  21. Marcin Jurdzinski (2000): Small Progress Measures for Solving Parity Games. In: STACS, Lecture Notes in Computer Science 1770. Springer, pp. 290–301, doi:10.1007/3-540-46541-3_24.
  22. Gijs Kant, Alfons Laarman, Jeroen Meijer, Jaco van de Pol, Stefan Blom & Tom van Dijk (2015): LTSmin: High-Performance Language-Independent Model Checking. In: TACAS, Lecture Notes in Computer Science 9035. Springer, pp. 692–707, doi:10.1016/S0304-3975(98)00009-7.
  23. Gijs Kant & Jaco van de Pol (2014): Generating and Solving Symbolic Parity Games. In: GRAPHITE, EPTCS 159, pp. 2–14, doi:10.4204/EPTCS.159.2.
  24. Orna Kupferman & Moshe Y. Vardi (1998): Weak Alternating Automata and Tree Automata Emptiness. In: STOC. ACM, pp. 224–233, doi:10.1145/276698.276748.
  25. Ruben Lapauw, Maurice Bruynooghe & Marc Denecker (2020): Improving Parity Game Solvers with Justifications. In: VMCAI, Lecture Notes in Computer Science 11990. Springer, pp. 449–470, doi:10.1016/S0304-3975(98)00009-7.
  26. 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.
  27. Pawel Parys (2019): Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time. In: MFCS, LIPIcs 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 10:1–10:13, doi:10.4230/LIPIcs.MFCS.2019.10.
  28. Guillermo A. Pérez (2019): The Extended HOA Format for Synthesis. CoRR abs/1912.05793.
  29. 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.
  30. Claude E Shannon (1938): A symbolic analysis of relay and switching circuits. Electrical Engineering 57(12), pp. 713–723, doi:10.1109/EE.1938.6431064.
  31. Fabio Somenzi (2001): Efficient manipulation of decision diagrams. Int. J. Softw. Tools Technol. Transf. 3(2), pp. 171–181, doi:10.1007/s100090100042.
  32. Antonio Di Stasio, Aniello Murano & Moshe Y. Vardi (2018): Solving Parity Games: Explicit vs Symbolic. In: CIAA, Lecture Notes in Computer Science 10977. Springer, pp. 159–172, doi:10.1016/S0304-3975(98)00009-7.
  33. Jens Vöge & Marcin Jurdzinski (2000): A Discrete Strategy Improvement Algorithm for Solving Parity Games. In: CAV, Lecture Notes in Computer Science 1855. Springer, pp. 202–215, doi:10.1016/0304-3975(95)00188-3.
  34. Igor Walukiewicz (2002): Monadic second-order logic on tree-like structures. Theor. Comput. Sci. 275(1-2), pp. 311–346, doi:10.1016/S0304-3975(01)00185-2.
  35. 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