1. Bowen Alpern & Fred B. Schneider (1985): Defining Liveness. Inf. Process. Lett. 21(4), pp. 181–185, doi:10.1016/0020-0190(85)90056-0.
  2. Ilan Beer, Shoham Ben-David, Cindy Eisner & Yoav Rodeh (2001): Efficient Detection of Vacuity in Temporal Model Checking. Formal Methods in System Design 18(2), pp. 141–163, doi:10.1023/A:1008779610539.
  3. Rüdiger Ehlers (2010): Short Witnesses and Accepting Lassos in ω-Automata. In: Adrian Horia Dediu, Henning Fernau & Carlos Mart\'ın-Vide: LATA, LNCS 6031. Springer, pp. 261–272, doi:10.1007/978-3-642-13089-2_22.
  4. Bernd Finkbeiner & Sven Schewe (2005): Uniform Distributed Synthesis. In: LICS. IEEE Computer Society, pp. 321–330, doi:10.1109/LICS.2005.53.
  5. Bernd Finkbeiner & Henny Sipma (2004): Checking Finite Traces Using Alternating Automata. Formal Methods in System Design 24(2), pp. 101–127, doi:10.1023/B:FORM.0000017718.28096.48.
  6. Karin Greimel, Roderick Bloem, Barbara Jobstmann & Moshe Y. Vardi (2008): Open Implication. In: Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir & Igor Walukiewicz: ICALP (2), LNCS 5126. Springer, pp. 361–372, doi:10.1007/978-3-540-70583-3_30.
  7. Marcin Jurdzinski (2000): Small Progress Measures for Solving Parity Games. In: Horst Reichel & Sophie Tison: STACS, LNCS 1770. Springer, pp. 290–301.
  8. O. Kupferman & M.Y. Vardi (1997): Synthesis with Incomplete Informatio. In: 2nd International Conference on Temporal Logic, Manchester, pp. 91–106.
  9. Orna Kupferman & Moshe Y. Vardi (2001): Model Checking of Safety Properties. Formal Methods in System Design 19(3), pp. 291–314, doi:10.1023/A:1011254632723.
  10. Leslie Lamport (1977): Proving the Correctness of Multiprocess Programs. IEEE Trans. Software Eng. 3(2), pp. 125–143, doi:10.1109/TSE.1977.229904.
  11. Zohar Manna & Amir Pnueli (1989): Completing the Temporal Picture. In: G. Ausiello, M. Dezani-Ciancaglini & S. Ronchi Della Rocca: ICALP, LNCS 372. Springer, pp. 534–558. Also in Theoretical Computer Science.
  12. Panagiotis Manolios & Richard J. Trefler (2001): Safety and Liveness in Branching Time. In: LICS, pp. 366–374.
  13. Panagiotis Manolios & Richard J. Trefler (2003): A lattice-theoretic characterization of safety and liveness. In: PODC, pp. 325–333, doi:10.1145/872035.872083.
  14. David E. Muller & Paul E. Schupp (1987): Alternating automata on infinite trees. Theor. Comput. Sci. 54(2-3), pp. 267–276, doi:10.1016/0304-3975(87)90133-2.
  15. David E. Muller & Paul E. Schupp (1995): Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra. Theor. Comput. Sci. 141(1-2), pp. 69–107, doi:10.1016/0304-3975(94)00214-4.
  16. Silvia M. Müller & Wolfgang J. Paul (2000): Computer Architecture: Complexity and Correctness. Springer.
  17. Nir Piterman (2007): From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata. Logical Methods in Computer Science 3(3), doi:10.2168/LMCS-3(3:5)2007.
  18. Amir Pnueli (1977): The Temporal Logic of Programs. In: FOCS. IEEE, pp. 46–57.
  19. Amir Pnueli & Roni Rosner (1989): On the Synthesis of a Reactive Module. In: POPL, pp. 179–190, doi:10.1145/75277.75293.
  20. Amir Pnueli, Aleksandr Zaks & Lenore D. Zuck (2006): Monitoring Interfaces for Faults. Electr. Notes Theor. Comput. Sci. 144(4), pp. 73–89, doi:10.1016/j.entcs.2006.02.005.
  21. Saqib Sohail & Fabio Somenzi (2009): Safety First: A Two-stage Algorithm for LTL Games. In: FMCAD. IEEE, pp. 77–84, doi:10.1109/FMCAD.2009.5351138.
  22. Wolfgang Thomas (2008): Church's Problem and a Tour through Automata Theory. In: Arnon Avron, Nachum Dershowitz & Alexander Rabinovich: Pillars of Computer Science, LNCS 4800. Springer, pp. 635–655, doi:10.1007/978-3-540-78127-1_35.
  23. Moshe Y. Vardi (1996): An Automata-theoretic Approach to Linear Temporal Logic. In: Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency: structure versus automata. Springer, pp. 238–266.
  24. Moshe Y. Vardi & Thomas Wilke (2007): Automata: from logics to algorithms. In: Jörg Flum, Erich Grädel & Thomas Wilke: Logic and Automata: History and Perspectives, Texts in Logic and Games 2. Amsterdam University Press, Amsterdam, pp. 629–736.
  25. Moshe Y. Vardi & Pierre Wolper (1994): Reasoning about Infinite Computations. Information and Computation 115, pp. 1–37, doi:10.1006/inco.1994.1092.

Comments and questions to:
For website issues: