References

  1. T. Ågotnes, V. Goranko & W. Jamroga (2007): Alternating-time temporal logics with irrevocable strategies. In: TARK'07, pp. 15–24, doi:10.1145/1324249.1324256.
  2. L. de Alfaro, P. Godefroid & R. Jagadeesan (2004): Three-Valued Abstractions of Games: Uncertainty, but with Precision. In: LICS'04. IEEE, pp. 170–179, doi:10.1109/LICS.2004.1319611.
  3. R. Alur, T. A. Henzinger & O. Kupferman (2002): Alternating-time temporal logic. Journal of the ACM 49(5), pp. 672–713, doi:10.1145/585265.585270.
  4. B. Aminof, A. Legay, A. Murano, O. Serre & M. Y. Vardi (2013): Pushdown module checking with imperfect information. Inf. Comput. 223(1), pp. 1–17, doi:10.1016/j.ic.2012.11.005.
  5. S. Basu, P. S. Roop & R. Sinha (2007): Local Module Checking for CTL Specifications. ENTCS 176 2, pp. 125–141, doi:10.1016/j.entcs.2006.02.035.
  6. L. Bozzelli (2011): New results on pushdown module checking with imperfect information. In: GandALF'11, EPTCS 54, pp. 162–177, doi:10.4204/EPTCS.54.12.
  7. L. Bozzelli, A. Murano & A. Peron (2010): Pushdown Module Checking. Formal Methods in System Design 36(1), pp. 65–95, doi:10.1007/s10703-010-0093-x.
  8. A.K. Chandra, D.C. Kozen & L.J. Stockmeyer (1981): Alternation. Journal of the ACM 28(1), pp. 114–133, doi:10.1145/322234.322243.
  9. K. Chatterjee, T. A. Henzinger & N. Piterman (2010): Strategy logic. Inf. Comput. 208(6), pp. 677–693, doi:10.1016/j.ic.2009.07.004.
  10. E.M. Clarke & E.A. Emerson (1981): Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic. In: LP'81, LNCS 131, pp. 52–71, doi:10.1007/BFb0025774.
  11. E.A. Emerson & J.Y. Halpern (1986): "Sometimes" and "Not Never" revisited: on branching versus linear time temporal logic. Journal of the ACM 33(1), pp. 151–178, doi:10.1145/4904.4999.
  12. E.A. Emerson & C.S. Jutla (1988): The Complexity of Tree Automata and Logics of Programs. In: FOCS'88, pp. 328–337, doi:10.1109/SFCS.1988.21949.
  13. A. Ferrante, A. Murano & M. Parente (2008): Enriched μ-Calculi Module Checking. Logical Methods in Computer Science 4(3:1), pp. 1–21, doi:10.2168/LMCS-4(3:1)2008.
  14. P. Godefroid (2003): Reasoning about Abstract Open Systems with Generalized Module Checking. In: EMSOFT'03, LNCS 2855. Springer, pp. 223–240, doi:10.1007/978-3-540-45212-6_15.
  15. W. Jamroga & A. Murano (2014): On module checking and strategies. In: AAMAS'14. IFAAMAS/ACM, pp. 701–708.
  16. W. Jamroga & A. Murano (2015): Module Checking of Strategic Ability. In: AAMAS'15. ACM, pp. 227–235.
  17. O. Kupferman & M. Y. Vardi (1998): Weak Alternating Automata and Tree Automata Emptiness. In: STOC'98. ACM, pp. 224–233, doi:10.1145/276698.276748.
  18. O. Kupferman & M.Y. Vardi (1996): Module Checking. In: CAV'96, LNCS 1102. Springer, pp. 75–86, doi:10.1007/3-540-61474-5_59.
  19. O. Kupferman & M.Y. Vardi (1997): Module Checking Revisited. In: CAV'97, LNCS 1254. Springer, pp. 36–47, doi:10.1007/3-540-63166-6_7.
  20. O. Kupferman, M.Y. Vardi & P. Wolper (2000): An Automata-Theoretic Approach to Branching-Time Model Checking. Journal of the ACM 47(2), pp. 312–360, doi:10.1145/333979.333987.
  21. F. Laroussinie & N. Markey (2014): Quantified CTL: Expressiveness and Complexity. Logical Methods in Computer Science 10(4), doi:10.2168/LMCS-10(4:17)2014.
  22. F. Laroussinie & N. Markey (2015): Augmenting ATL with strategy contexts. Inf. Comput. 245, pp. 98–123, doi:10.1016/j.ic.2014.12.020.
  23. F. Martinelli & I. Matteucci (2007): An Approach for the Specification, Verification and Synthesis of Secure Systems. ENTCS 168, pp. 29–43, doi:10.1016/j.entcs.2006.12.003.
  24. F. Mogavero, A. Murano, G. Perelli & M. Y. Vardi (2014): Reasoning About Strategies: On the Model-Checking Problem. ACM Trans. Comput. Log. 15(4), pp. 34:1–34:47, doi:10.1145/2631917.
  25. A. Murano, M. Napoli & M. Parente (2008): Program Complexity in Hierarchical Module Checking. In: LPAR'08, LNCS 5330. Springer, pp. 318–332, doi:10.1007/978-3-540-89439-1_23.
  26. A. Pnueli (1977): The Temporal Logic of Programs. In: FOCS'77. IEEE, pp. 46–57, doi:10.1109/SFCS.1977.32.
  27. J.P. Queille & J. Sifakis (1982): Specification and verification of concurrent programs in Cesar. In: SP'82, LNCS 137. Springer, pp. 337–351, doi:10.1007/3-540-11494-7_22.
  28. S. Safra (1988): On the Complexity of ω-Automata. In: FOCS'88. IEEE, pp. 319–327, doi:10.1109/SFCS.1988.21948.
  29. S. Schewe (2008): ATL* Satisfiability Is 2EXPTIME-Complete. In: ICALP'08, LNCS 5126. Springer, pp. 373–385, doi:10.1007/978-3-540-70583-3_31.
  30. S. Schewe & B. Finkbeiner (2006): Satisfiability and Finite Model Property for the Alternating-Time mu-Calculus. In: CSL'06, LNCS 4207. Springer, pp. 591–605, doi:10.1007/11874683_39.
  31. M. Y. Vardi & P. Wolper (1994): Reasoning About Infinite Computations. Inf. Comput. 115(1), pp. 1–37, doi:10.1006/inco.1994.1092.
  32. 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.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org