References

1. Sergei N. Artëmov & Anil Nerode (2009): Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings. Lecture Notes in Computer Science 5407. Springer. Available at http://dx.doi.org/10.1007/978-3-540-92687-0.
2. Orna Bernholtz, Moshe Y. Vardi & Pierre Wolper (1994): An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract). In: David L. Dill: CAV, Lecture Notes in Computer Science 818. Springer, pp. 142–155. Available at http://dx.doi.org/10.1007/3-540-58179-0_50.
3. E. Emerson & J. Halpern (1986): `Sometimes' and `not never' revisited. J. ACM 33. Available at http://dx.doi.org/10.1145/4904.4999.
4. E. Emerson & C. Jutla (1988): Complexity of Tree Automata and Modal Logics of Programs. In: 29th IEEE Foundations of Computer Science, Proceedings. IEEE.
5. E. Emerson & A. Sistla (1984): Deciding full branching time logic. Inf. and Control 61, pp. 175 – 201. Available at http://dx.doi.org/10.1016/S0019-9958(84)80047-9.
6. E.A. Emerson (1990): Temporal and modal logic. In: J. van Leeuwen: Hbk of Th. Comp. Sci. vol. = "B",. Elsevier.
7. O. Friedmann, M. Latte & M. Lange (2010): A Decision Procedure for CTL* Based on Tableaux and Automata.. In: IJCAR'10, pp. 331–345. Available at http://dx.doi.org/10.1007/978-3-642-14203-1_28.
8. Valentin Goranko & Dmitry Shkatov (2009): Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic. In: Artëmov & Nerode, pp. 197–213. Available at http://dx.doi.org/10.1007/978-3-540-92687-0_14.
9. Orna Kupferman & Moshe Y. Vardi (2005): Safraless Decision Procedures. In: FOCS. IEEE Computer Society, pp. 531–542. Available at http://doi.ieeecomputersociety.org/10.1109/SFCS.2005.66.
10. M. Lange & C. Stirling (2000): Model Checking Games for CTL*. In: In ICTL'00, pp. 115–125.
11. J. McCabe-Dansted (2011): A Rooted Tableau for BCTL. Electr. Notes Theor. Comput. Sci. 278, pp. 145–158. Available at http://dx.doi.org/10.1016/j.entcs.2011.10.012.
12. Fabio Mogavero, Aniello Murano, Giuseppe Perelli & Moshe Y. Vardi (2012): What Makes ATL* Decidable? A Decidable Fragment of Strategy Logic. In: Maciej Koutny & Irek Ulidowski: CONCUR, Lecture Notes in Computer Science 7454. Springer, pp. 193–208. Available at http://dx.doi.org/10.1007/978-3-642-32940-1_15.
13. A. Pnueli (1977): The temporal logic of programs. In: Proceedings of the Eighteenth Symposium on Foundations of Computer Science, pp. 46–57. Providence, RI.
14. M. Reynolds (2001): An Axiomatization of Full Computation Tree Logic. J.S.L. 66(3), pp. 1011–1057.
15. M. Reynolds (May, 2013): A Faster Tableau for CTL*, Long Version. Technical Report. CSSE, UWA. Available at http://www.csse.uwa.edu.au/~mark/research/Online/quicktab/. Implemented reasoner also available here..
16. Mark Reynolds (2009): A Tableau for CTL*. In: Ana Cavalcanti & Dennis Dams: FM 2009: Eindhoven, 2009. Proc., Lecture Notes in Computer Science 5850. Springer, pp. 403–418. Available at http://dx.doi.org/10.1007/978-3-642-05089-3_26.
17. M. Reynolds (2011): A tableau-based decision procedure for CTL*. J. Formal Aspects of Comp., pp. 1–41. Available at http://dx.doi.org/10.1007/s00165-011-0193-4.
18. M. Vardi & L. Stockmeyer (1985): Improved Upper and Lower Bounds for Modal Logics of Programs. In: 17th ACM Symp. on Theory of Computing, Proceedings. ACM, pp. 240–251. Available at http://dx.doi.org/10.1145/22145.22173.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org