1. Lecture Notes in Computer Science;E.M. Clarke,1982
2. Emerson, E.A., Halpern, J.Y.: Sometimes and not never revisited: On branching versus linear time. Journal of the ACM 33(1), 151–178 (1986)
3. Lecture Notes in Computer Science;T.. Hafer,1987
4. Kupferman, O., Pnueli, A.: Once and For All. In: Proc. 10th LICS, pp. 25–35. IEEE Comp. Soc. Press, Los Alamitos (1995)
5. Kupferman, O., Vardi, M.Y.: Weak alternating automata and tree automata emptiness. In: Proc. 30th STOC, pp. 224–233. ACM, New York (1998)