References

  1. Rajeev Alur, Thomas A. Henzinger & Orna Kupferman (2002): Alternating-time temporal logic. J. ACM 49(5), pp. 672–713, doi:10.1145/585265.585270.
  2. Francesco Belardinelli, Alessio Lomuscio, Aniello Murano & Sasha Rubin (2017): Verification of Multi-agent Systems with Imperfect Information and Public Actions. In: Proceedings of AAMAS '17, pp. 1268–1276.
  3. Raphaël Berthon, Bastien Maubert & Aniello Murano (2017): Decidability Results for ATL* with Imperfect Information and Perfect Recall. In: Proceedings of AAMAS '17, pp. 1250–1258.
  4. Piergiorgio Bertoli, Alessandro Cimatti & Marco Pistore (2006): Towards Strong Cyclic Planning Under Partial Observability. In: Proceedings of ICAPS'06, pp. 354–357.
  5. Piergiorgio Bertoli, Alessandro Cimatti, Marco Roveri & Paolo Traverso (2006): Strong planning under partial observability. Artificial Intelligence 170(4), pp. 337 – 384, doi:10.1016/j.artint.2006.01.004.
  6. Rodica Bozianu, Cătălin Dima & Emmanuel Filiot (2014): Safraless Synthesis for Epistemic Temporal Specifications. In: Computer Aided Verification, LNCS 8559. Springer International Publishing, pp. 441–456, doi:10.1007/978-3-319-08867-9_29.
  7. R. E. Bryant (1986): Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers C-35(8), pp. 677–691, doi:10.1109/TC.1986.1676819.
  8. Simon Busard & Charles Pecheur (2013): PyNuSMV: NuSMV as a Python Library. In: Proceedings of NFM 2013, pp. 453–458, doi:10.1007/978-3-642-38088-4_33.
  9. Simon Busard, Charles Pecheur, Hongyang Qu & Franco Raimondi (2013): Reasoning about Strategies under Partial Observability and Fairness Constraints. In: Proceedings of SR 2013, pp. 71–79, doi:10.4204/EPTCS.112.12.
  10. Simon Busard, Charles Pecheur, Hongyang Qu & Franco Raimondi (2014): Improving the Model Checking of Strategies under Partial Observability and Fairness Constraints. In: Formal Methods and Software Engineering, LNCS 8829. Springer International Publishing, pp. 27–42, doi:10.1007/978-3-319-11737-9_3.
  11. Simon Busard, Charles Pecheur, Hongyang Qu & Franco Raimondi (2015): Reasoning about memoryless strategies under partial observability and unconditional fairness constraints. Information and Computation 242, pp. 128 – 156, doi:10.1016/j.ic.2015.03.014.
  12. Jan Calta, Dmitry Shkatov & Holger Schlingloff (2010): Finding Uniform Strategies for Multi-agent Systems. In: Computational Logic in Multi-Agent Systems, LNCS 6245. Springer, pp. 135–152, doi:10.1007/978-3-642-14977-1_12.
  13. Alessandro Cimatti, Edmund Clarke, Enrico Giunchiglia, Fausto Giunchiglia, Marco Pistore, Marco Roveri, Roberto Sebastiani & Armando Tacchella (2002): NuSMV 2: An OpenSource Tool for Symbolic Model Checking. In: Computer Aided Verification. Springer, pp. 359–364, doi:10.1007/3-540-45657-0_29.
  14. Mehdi Dastani & Wojciech Jamroga (2010): Reasoning about strategies of multi-agent programs. In: Proceedings of AAMAS 10, pp. 997–1004.
  15. Catalin Dima & Ferucio Laurentiu Tiplea (2011): Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable. CoRR abs/1102.4225. Available at http://arxiv.org/abs/1102.4225.
  16. Xiaowei Huang & Ron van der Meyden (2014): Symbolic Model Checking Epistemic Strategy Logic. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pp. 1426–1432.
  17. Wojciech Jamroga & Jürgen Dix (2006): Model Checking Abilities under Incomplete Information Is Indeed Δ^P_2-complete. In: EUMAS'06.
  18. Wojciech Jamroga & Wiebe van der Hoek (2004): Agents that Know How to Play. Fundamenta Informaticae Volume 63(2), pp. 185–219.
  19. Alessio Lomuscio & Franco Raimondi (2006): Model checking knowledge, strategies, and games in multi-agent systems. In: AAMAS 2006, Hakodate, Japan, May 8-12, 2006, pp. 161–168, doi:10.1145/1160633.1160660.
  20. G. Peterson, J. Reif & S. Azhar (2002): Decision algorithms for multiplayer noncooperative games of incomplete information. Computers and Mathematics with Applications 43(1), pp. 179 – 206, doi:10.1016/S0898-1221(01)00282-6.
  21. Jerzy Pilecki, Marek A. Bednarczyk & Wojciech Jamroga (2014): Synthesis and Verification of Uniform Strategies for Multi-agent Systems. In: Computational Logic in Multi-Agent Systems, LNCS 8624. Springer International Publishing, pp. 166–182, doi:10.1007/978-3-319-09764-0_11.
  22. R. Ramanujam & Sunil Simon (2010): A Communication Based Model for Games of Imperfect Information, pp. 509–523. Springer Berlin Heidelberg, Berlin, Heidelberg, doi:10.1007/978-3-642-15375-4_35.
  23. Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen & Thomas A. Henzinger (2007): Algorithms for Omega-Regular Games with Imperfect Information. Logical Methods in Computer Science 3(3), doi:10.2168/LMCS-3(3:4)2007.
  24. Pierre-Yves Schobbens (2004): Alternating-time logic with imperfect recall. Electronic Notes in Theoretical Computer Science 85(2), pp. 82 – 93, doi:10.1016/S1571-0661(05)82604-0.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org