~graph$ $G_0=\langle N,       E, L_0\rangle$ with id $0$ (see Figure 00) and return a labeling function $L_0=\{(s_0,0),(s_0,0),(s_0,0),(s_0,0)\}$;      ![](newfig000.eps)  0.  to process $s_0\wedge EX(E[\neg s_0 U(s_0\wedge\neg s_0)]\vee       EG\neg s_0)$, $HandleNegation$ and $HandleUnion$ are called with $L_0$ and $L_0$ to return a labeling function $L_0=\{(s_0,0)\}$;  0