Albanese, M., Jajodia, S., & Noel, S. (2012). Time-efficient and cost-effective network hardening using attack graphs. DSN (pp. 1-12). Boston, USA: IEEE.
Bistarelli, S., Fioravanti, F., & Peretti, P. (2006). Defence Trees for Economic Evaluation of Security Investments. ARES (pp. 416-423). Vienna, Austria: IEEE.
Edge, K., Dalton, G., Raines, R., & Mills, R. (2006). Using Attack and Protection Trees to Analyze Threats and Defences to Homeland Security. MILCOM (pp. 1-7). Washington, DC, USA: IEEE.
Egesdal, M., Gomez-Jordana, A., Pelissier, C., Prause, M., Savani, R., & Stengel, B. (2015). Game Theory Explorer. Retrieved from http://gte.csc.liv. ac.uk/gte/builder
Hightower, T. (n. d.). Boyd's OODA loop and how we use it. Retrieved from Tactical Response: https://tacticalresponse.com/blogs/library/18649427-boyd-s-o-o-d-a-loop-and-how-we-use-it
Kordy, B., Mauw, S., & Radomirovic, S. (2014). Attack-defence trees. Journal of Logic and Computation, 24(1), pp. 55-87.
Kordy, B., Mauw, S., Melissen, M., & Schweitzer, P. (2010). Attack-Defence Trees and Two-Player Binary Zero-Sum Extensive Form Games Are Equivalent. GameSec (pp. 245-256). Springer.
Paul, S. (2014). Towards automating the construction & maintenance of attack trees: a feasibility study. GraMSec (pp. 31-46). Grenoble, France: EPTCS.
Savani, R., & Stengel, B. (2015). Game Theory Explorer: Software for the Applied Game Theorist. Computational Management Science, 12(1), pp. 5-33.
