2013
DOI: 10.3182/20130904-3-uk-4041.00007
|View full text |Cite
|
Sign up to set email alerts
|

A methodology for qualitative/quantitative analysis of weighted attack trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
20
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(24 citation statements)
references
References 11 publications
4
20
0
Order By: Relevance
“…Numerous analysis methods for quantitative analysis of attack trees and fault trees exist [2,6,15,23,29,41,45]. In this section, we give an overview of two common algorithms for fault trees and attack trees.…”
Section: Analysis Algorithms For Attack and Fault Treesmentioning
confidence: 99%
See 1 more Smart Citation
“…Numerous analysis methods for quantitative analysis of attack trees and fault trees exist [2,6,15,23,29,41,45]. In this section, we give an overview of two common algorithms for fault trees and attack trees.…”
Section: Analysis Algorithms For Attack and Fault Treesmentioning
confidence: 99%
“…As a matter of fact, computing metrics in a DAG-structured DT T is an NP-complete problem. Various methods to analyse DAG-structured DTs have been proposed: contributions over the last 15 years include [2,6,15,23,29]. We now detail our recent work on binary decision diagrams (BDDs) [9].…”
Section: Algorithms For Dag-shaped Dtsmentioning
confidence: 99%
“…Dynamic tree Static DAG Dynamic DAG min cost BU [14,15,16] BU [4] MTBDD [17] C-BU [18] PTA [8] min time BU [14,19] APH [9] BU [4] Petri nets [12] PTA [8] min skill BU [14,20] BU [4] C-BU [18] max damage BU [14,19,20] BU [4] MTBDD [17] DPLL [7] PTA [8] probability BU [6,19] APH [9] BDD [21] DPLL [7] I/O-IMC [5] Pareto fronts BU [22,19] OPEN PROBLEM C-BU [11] PTA [8] Any of the above Algo. 1: BUSAT Algo.…”
Section: Metric Static Treementioning
confidence: 99%
“…Static DAGs: It is well-known that static attack trees with DAG structure cannot be analysed via a bottom-up procedure [21,23]. Several algorithms have been devised to tackle with such ATs, mostly geared to specific metrics [5,17,12,7,18].…”
Section: Open Problemmentioning
confidence: 99%
“…In [22] the Weighted-ADT (WADT), an enriched version of the ADT formal method, is presented. The WADT allows to perform qualitative and quantitative analysis enhancing the formalism with cost and impact attributes.…”
Section: Related Workmentioning
confidence: 99%