I. Arce and G. Mcgraw, Why attacking systems is a good idea, IEEE Security & Privacy Magazine, vol.2, issue.4, 2004.

R. Bellman, The theory of dynamic programming, Bulletin of the American Mathematical Society, vol.60, issue.6, pp.503-516, 1954.
DOI : 10.1090/S0002-9904-1954-09848-8

D. Bilar, Quantitative Risk Analysis of Computer Networks, 2003.

M. S. Boddy, J. Gohde, T. Haigh, and S. A. Harp, Course of action generation for cyber security using classical planning, Proc. of ICAPS'05, 2005.

B. Bonet, Deterministic POMDPs revisited, Proc. of UAI'09, 2009.

A. R. Cassandra, Exact and Approximate Algorithms for Partially Observable Markov Decision Processes, Ph.D. Dissertation, 1998.

J. Dawkins, H. , and J. , A systematic approach to multi-stage network attack analysis, Second IEEE International Information Assurance Workshop, 2004. Proceedings., 2003.
DOI : 10.1109/IWIA.2004.1288037

D. Koller and N. Friedman, Probabilistic Graphical Models: Principles and Techniques, 2009.

H. Kurniawati, D. Hsu, and W. Lee, SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces, Robotics: Science and Systems IV, 2008.
DOI : 10.15607/RSS.2008.IV.009

J. Lucangeli, C. Sarraute, and G. Richarte, Attack planning in the real world, SecArt'10, 2010.

G. F. Lyon, Remote OS detection via TCP/IP stack fingerprinting, Phrack Magazine, vol.8, issue.54, 1998.

G. Monahan, State of the Art???A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms, Management Science, vol.28, issue.1, pp.1-16, 1982.
DOI : 10.1287/mnsc.28.1.1

C. Sarraute, G. Richarte, and J. Lucangeli, An algorithm to find optimal attack paths in nondeterministic scenarios, Proceedings of the 4th ACM workshop on Security and artificial intelligence, AISec '11, 2011.
DOI : 10.1145/2046684.2046695