# VRS Sheet 7 Q1, I did not understand the question related to Ziolenka algorithm? Any leads?

+1 vote
The exercise is about a graph game with two players. Player 0 chooses a transition in the oval nodes while player 1 chooses a transition in the rectangle nodes. This creates an infinite path where the winner of the game is determined by checking the nodes that occur infinitely often on the generated path. The Zielonka algorithm can be used to compute a winning strategy for the players if there is one. Have a look at the teaching tool https://es.cs.uni-kl.de/tools/teaching/ReactiveSynthesis.html that helps you with the solution.
by (170k points)
Thanks for the response. I have tried to decode the working but I did not get it what the attractor is how the algorithm is working etc. If you can provide a detail answer, it will be great.
Solving parity games with Zielonka's algorithm is described in detail in the final section of the chapter on μ-calculus. There you can read that attrA(φ) is the set of states where player A can enforce reaching a φ-state hence, attrA(φ) :⇔ μx.(φ ∨ ⟨A⟩x) where ⟨A⟩φ means that player A can enforce a transition to a state where φ holds. This is defines as  ⟨A⟩φ := A ∧ ♦φ ∨ B ∧ φ, i.e., a state belongs to ⟨A⟩φ if player A can choose a transition, and there is a transition to φ or if player B can choose and all transitions lead to φ. The attractor set attrA(φ) is therefore the set of states where player A can enforce a path to the states φ no matter what player B will do.
What does A & B here refer to? Does A & B refer to player 0(oval) and player 1(rectangle) respectively? I was able to understand the trace of the algorithm but the only part I am getting confused is calculating the attractors. I understood what this equation meant ⟨A⟩φ := A ∧ ♦φ ∨ B ∧ φ. However I was not able to figure out what A & B stands for? Could you please give an example?
The game has player A and player B which are in parity games also called player 0 (oval nodes) and player 1 (rectangle nodes).
Thank you for the clarification.
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}