![](bg8.png)
Durkota, K., Lisy, V., Bo
ˇ
sansky, B., and Kiekintveld, C.
(2015b). Optimal network security hardening using
attack graph games. In IJCAI 2015, pages 526–532.
M. Faella, M. Napoli, and M. Parente (2010). Graded
alternating-time temporal logic. Fundam. Informati-
cae, 105(1-2):189–210, 2010.
A. Ferrando and V. Malvone (2022). Towards the combi-
nation of model checking and runtime verification on
multi-agent systems. In PAAMS 2022, pages 140–
152.
Heberlein, T., Bishop, M., Ceesay, E., Danforth, M.,
Senthilkumar, C., and Stallard, T. (2012). A taxon-
omy for comparing attack-graph approaches. [Online]
http://netsq. com/Documents/AttackGraphPaper. pdf.
Homer, J., Zhang, S., Ou, X., Schmidt, D., Du, Y., Ra-
jagopalan, S. R., and Singhal, A. (2013). Aggregat-
ing vulnerability metrics in enterprise networks using
attack graphs. J. Comput. Secur., 21(4):561–597.
Ingols, K., Lippmann, R., and Piwowarski, K. (2006). Prac-
tical attack graph generation for network defense. In
ACSAC 2006, pages 121–130.
Jamroga, W. and Murano, A. (2015). Module checking of
strategic ability. In AAMAS 2015, pages 227–235.
Jennings, N. R. and Wooldridge, M. (1998). Application of
intelligent agents. In Agent Technology: Foundations,
Applications, and Markets. Springer-Verlag.
Jha, S., Sheyner, O., and Wing, J. (2002). Two formal anal-
yses of attack graphs. In CSFW-15, pages 49–63.
Kaynar, K. (2016). A taxonomy for attack graph generation
and usage in network security. J. Inf. Secur. Appl.,
29(C):27–56.
Kupferman, O., Vardi, M., and Wolper, P. (2000). An Au-
tomata Theoretic Approach to Branching-Time Mod-
elChecking. Journal of the ACM, 47(2):312–360.
Kupferman, O., Vardi, M., and Wolper, P. (2001).
Module Checking. Information and Computation,
164(2):322–344.
Lippmann, R. P. and Ingols, K. W. (2005). An annotated
review of past papers on attack graphs.
L
¨
oding, C. and Rohde, P. (2003). Solving the sabotage
game is pspace-hard. In MFCS 2003, pages 531–540.
Lomuscio, A., Qu, H., and Raimondi, F. (2009). MCMAS:
A model checker for the verification of multi-agent
systems. In CAV 2009, pages 682–688.
McMillan, K. L. (1993). Symbolic model checking. In
Symbolic Model Checking, pages 25–60.
Mogavero, F., Murano, A., Perelli, G., and Vardi, M. Y.
(2014). Reasoning about strategies: On the model-
checking problem. ACM Transactions in Computa-
tional Logic, 15(4):34:1–34:47.
Nguyen, T. H., Wright, M., Wellman, M. P., and Baveja,
S. (2017). Multi-stage attack graph security games:
Heuristic strategies, with empirical game-theoretic
analysis. MTD 2017, pages 87–97.
Noel, S., Jajodia, S., O’Berry, B., and Jacobs, M. (2003).
Efficient minimum-cost network hardening via exploit
dependency graphs. In ACSAC 2003, page 86.
Ou, X., Boyer, W. F., and McQueen, M. A. (2006). A
scalable approach to attack graph generation. In CCS
2006, pages 336–345.
Phillips, C. and Swiler, L. P. (1998). A graph-based system
for network-vulnerability analysis. In NSPW 1998,
pages 71–79.
Ritchey, R. W. and Ammann, P. (2000). Using model check-
ing to analyze network vulnerabilities. In S&P 2000,
pages 156–165.
Sheyner, O., Haines, J., Jha, S., Lippmann, R., and Wing, J.
(2002). Automated generation and analysis of attack
graphs. pages 273– 284.
Thomas, W. (1990). Automata on Infinite Objects. In Hand-
book of Theoretical Computer Science (vol. B), pages
133–191. MIT Press.
J. van Benthem (2005). An Essay on Sabotage and Obstruc-
tion. In MMR, pages 268–276.
Vardi, M. Y. (2011). The rise and fall of LTL. In Gandalf,
54.
Zeng, J., Wu, S., Chen, Y., Zeng, R., Wu, C., and Caballero-
Gil, P. (2019). Survey of attack graph analysis meth-
ods from the perspective of data and knowledge pro-
cessing. SCN.
Zhang, Y. and Malacaria, P. (2021). Bayesian stackel-
berg games for cyber-security decision support. Decis.
Support Syst., 148:113599.
ICAART 2023 - 15th International Conference on Agents and Artificial Intelligence
354