New Efficient Utility Upper Bounds for the Fully Adaptive Model of Attack Trees

DOI10.1007/978-3-319-02786-9_12zbMath1423.68085OpenAlexW2112850401WikidataQ62048355 ScholiaQ62048355MaRDI QIDQ3190044

Ahto Buldas, Aleksandr Lenin

Publication date: 15 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-02786-9_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer system organization (68M99)

Related Items (2)

A review of attack graph and attack tree visual syntax in cyber security ⋮ DAG-based attack and defense modeling: don't miss the forest for the attack trees

This page was built for publication: New Efficient Utility Upper Bounds for the Fully Adaptive Model of Attack Trees