A. I. Mcgraw-g, Why attacking systems is a good idea, 2004.

B. D. Tsitsiklis-j, Neurodynamic Programming, 1996.

B. M. , G. J. Haigh-t, and . A. Harp-s, Course of action generation for cyber security using classical planning, Proc. of ICAPS'05, 2005.

H. E. Feng-z, Dynamic programming for POMDPs using a factored state representation, Proceedings of the International Conference on AI Planning and Scheduling (AIPS'00), 2000.

H. J. Tarjan-r, Algorithm 447 : efficient algorithms for graph manipulation, Communications of the ACM, vol.16, pp.372-378, 1973.

K. L. and L. M. Cassandra, Planning and acting in partially observable stochastic domains, Artificial Intelligence, vol.101, issue.12, pp.99-134, 1998.

K. H. Hsu-d and . W. Lee, SARSOP : Efficient point-based POMDP planning by approximating optimally reachable belief spaces, Robotics : Science and Systems IV, 2008.

L. J. and S. C. Richarte-g, Attack planning in the real world, Workshop on Intelligent Security, 2010.

M. F. Biundo-s, HTN-style planning in relational POMDPs using first-order FSCs, Proceedings of the 34th German Conference on AI (KI'11), pp.216-227, 2011.

P. J. and G. G. Thrun-s, Policy-contingent abstraction for robust robot control, Proceedings of the 19th Conference on Uncertainty in Articifical Intelligence (UAI'03), pp.477-484, 2003.

S. C. Buffet-o and . Hoffmann-j, Penetration testing == POMDP solving, Proceedings of the 3rd Workshop on Intelligent Security, 2011.

S. C. and R. G. Lucangeli-j, An algorithm to find optimal attack paths in nondeterministic scenarios, In ACM Workshop on Artificial Intelligence and Security, issue.11, 2011.