1. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672–713 (2002).
https://doi.org/10.1145/585265.585270
2. Bauland, M., Mundhenk, M., Schneider, T., Schnoor, H., Schnoor, I., Vollmer, H.: The tractability of model checking for LTL: the good, the bad, and the ugly fragments. TOCL 12(2), 26 (2011)
3. Bauland, M., Schneider, T., Schnoor, H., Schnoor, I., Vollmer, H.: The complexity of generalized satisfiability for linear temporal logic. LMCS 5(1), 1–21 (2009)
4. Beyersdorff, O., Meier, A., Mundhenk, M., Schneider, T., Thomas, M., Vollmer, H.: Model checking CTL is almost always inherently sequential. LMCS 7(2), 1–21 (2011)
5. Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with boolean blocks, part I: Post’s lattice with applications to complexity theory. SIGACT 34(4), 38–52 (2003)