On modal mu-calculus over reflexive and symmetric graphs

In this article, we consider the hierarchy of the modal mu-calculus over reflexive and symmetric graphs and show that in this class the modal mu-calculus hierarchy is infinite. In the proof, a parity game over a tree is transformed into a equivalent parity game where Duplicator, when playing over the reflexive and symmetric closure of the tree, will never use loops or back edges