Algorithm 3. Emerson-Lei algorithm for E_fairGψ on Kripke model M and fairness constraints $\mathcal{F}$.

1: procedure SATEFAIRG(M, ψ, $\mathcal{F}$)

2: S ← Sat(ψ)

3: repeat

4:   S′ ← S

5:   for each Fi ∈ $\mathcal{F}$: do

6:    Y ← SATCTL(M, E (S U (Fi ∩ S)))

7:    S ← S ∩ SATCTL(M, EX Y))

8:   end for

9:  until S = S’ // Repeat until fixed point is reached.

10: return S

11: end procedure