This paper deals with computational aspects of attack trees, more precisely, evaluating the expected adversarial utility in the failurefree game, where the adversary is allowed to re-run failed atomic attacks an unlimited number of times. It has been shown by Buldas and Lenin that exact evaluation of this utility is an NP-complete problem, so a computationally feasible approximation is needed. In this paper we consider a genetic approach for this challenge. Since genetic algorithms depend on a number of non-trivial parameters, we face a multi-objective optimization problem and we consider several heuristic criteria to solve it.
CITATION STYLE
Lenin, A., Willemson, J., & Charnamord, A. (2015). Genetic approximations for the failure-free security games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9406, pp. 311–321). Springer Verlag. https://doi.org/10.1007/978-3-319-25594-1_17
Mendeley helps you to discover research relevant for your work.