References

  1. R.Alur & T.A. Henzinger (1998): Finitary Fairness.. TOPLAS 20(6), pp. 1171–1194, doi:10.1145/295656.295659.
  2. R.Alur, T.A. Henzinger & O.Kupferman (2002): Alternating-Time Temporal Logic.. JACM 49(5), pp. 672–713, doi:10.1145/585265.585270.
  3. R.Alur & S.La Torre (2004): Deterministic generators and games for LTL fragments. ACM Transactions on Computational Logic (TOCL) 5(1), pp. 1–25, doi:10.1145/963927.963928.
  4. B.Aminof, A.Murano, S.Rubin & F.Zuleger (2016): Prompt Alternating-Time Epistemic Logics. In: KR'16. AAAI Press, pp. 258–267.
  5. P.A. Bonatti, C.Lutz, A.Murano & M.Y. Vardi (2008): The Complexity of Enriched muCalculi.. LMCS 4(3), pp. 1–27, doi:10.2168/LMCS-4(3:11)2008.
  6. L.Bozzelli, A.Murano & A.Peron (2010): Pushdown Module Checking.. FMSD 36(1), pp. 65–95, doi:10.1007/s10703-010-0093-x.
  7. K.Chatterjee, T.A. Henzinger & F.Horn (2010): Finitary Winning in omega-Regular Games.. TOCL 11(1), pp. 1:1–26, doi:10.1145/1614431.1614432.
  8. E.M. Clarke & E.A. Emerson (1981): Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic.. In: LP'81, LNCS 131. Springer, pp. 52–71, doi:10.1007/BFb0025774.
  9. E.M. Clarke, E.A. Emerson & A.P. Sistla (1986): Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications.. TOPLAS 8(2), pp. 244–263, doi:10.1145/5397.5399.
  10. E.M. Clarke, O.Grumberg & D.A. Peled (2002): Model Checking.. MIT Press.
  11. E.A. Emerson & J.Y. Halpern (1985): Decision Procedures and Expressiveness in the Temporal Logic of Branching Time.. JCSS 30(1), pp. 1–24, doi:10.1016/0022-0000(85)90001-7.
  12. E.A. Emerson & J.Y. Halpern (1986): ``Sometimes'' and ``Not Never'' Revisited: On Branching Versus Linear Time.. JACM 33(1), pp. 151–178, doi:10.1145/4904.4999.
  13. E.A. Emerson & C.S. Jutla (1988): The Complexity of Tree Automata and Logics of Programs (Extended Abstract).. In: FOCS'88. IEEE Computer Society, pp. 328–337, doi:10.1109/SFCS.1988.21949.
  14. A.Ferrante, A.Murano & M.Parente (2008): Enriched Mu-Calculi Module Checking.. LMCS 4(3), pp. 1–21, doi:10.2168/LMCS-4(3:1)2008.
  15. E.Grädel, W.Thomas & T.Wilke (2002): Automata, Logics, and Infinite Games: A Guide to Current Research.. LNCS 2500. Springer, doi:10.1007/3-540-36387-4.
  16. S.A. Kripke (1963): Semantical Considerations on Modal Logic.. APF 16, pp. 83–94, doi:10.1002/malq.19630090502.
  17. O.Kupferman, G.Morgenstern & A.Murano (2006): Typeness for omega-Regular Automata.. IJFCS 17(4), pp. 869–884, doi:10.1142/S0129054106004157.
  18. O.Kupferman, N.Piterman & M.Y. Vardi (2002): Pushdown Specifications.. In: LPAR'02, LNCS 2514. Springer, pp. 262–277, doi:10.1007/3-540-36078-6_18.
  19. O.Kupferman, N.Piterman & M.Y. Vardi (2009): From Liveness to Promptness.. FMSD 34(2), pp. 83–103, doi:10.1007/s10703-009-0067-z.
  20. O.Kupferman, A.Pnueli & M.Y. Vardi (2012): Once and For All.. JCSS 78(3), pp. 981–996, doi:10.1016/j.jcss.2011.08.006.
  21. O.Kupferman, M.Y. Vardi & P.Wolper (2000): An Automata Theoretic Approach to Branching-Time Model Checking.. JACM 47(2), pp. 312–360, doi:10.1145/333979.333987.
  22. O.Kupferman, M.Y. Vardi & P.Wolper (2001): Module Checking.. IC 164(2), pp. 322–344, doi:10.1006/inco.2000.2893.
  23. F.Mogavero, A.Murano, G.Perelli & M.Y. Vardi (2014): Reasoning About Strategies: On the Model-Checking Problem.. TOCL 15(4), pp. 34:1–42, doi:10.1145/2631917.
  24. F.Mogavero, A.Murano & L.Sorrentino (2015): On Promptness in Parity Games. Fundamenta Informaticae 139(3), pp. 277–305, doi:10.3233/FI-2015-1235.
  25. A.Pnueli (1977): The Temporal Logic of Programs.. In: FOCS'77. IEEE Computer Society, pp. 46–57, doi:10.1109/SFCS.1977.32.
  26. M.Y. Vardi (1998): Reasoning about The Past with Two-Way Automata.. In: ICALP'98, LNCS 1443. Springer, pp. 628–641, doi:10.1007/BFb0055090.
  27. M.Y. Vardi & P.Wolper (1986): An Automata-Theoretic Approach to Automatic Program Verification.. In: LICS'86. IEEE Computer Society, pp. 332–344.
  28. P.Wolper (1983): Temporal Logic Can Be More Expressive.. IC 56(1-2), pp. 72–99, doi:10.1016/S0019-9958(83)80051-5.
  29. W.Zielonka (1998): Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees.. TCS 200(1-2), pp. 135–183, doi:10.1016/S0304-3975(98)00009-7.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org