Parametric Analyses of Attack-fault Trees*
From MaRDI portal
Publication:5025035
DOI10.3233/FI-2021-2066zbMath1491.68034arXiv1902.04336MaRDI QIDQ5025035
Mariëlle I. A. Stoelinga, Mathias Ramparison, Étienne André, Didier Lime
Publication date: 1 February 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.04336
Related Items (2)
Assessing security of cryptocurrencies with attack-defense trees: proof of concept and future directions ⋮ \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability
Uses Software
Cites Work
- Unnamed Item
- Stochastic model checking. Rigorous dependability analysis using model checking techniques for stochastic systems. International autumn school, ROCKS 2012, Vahrn, Italy, October 22--26, 2012. Advanced lectures
- DAG-based attack and defense modeling: don't miss the forest for the attack trees
- Optimal paths in weighted timed automata
- Timed verification of the generic architecture of a memory circuit using parametric timed automata
- A theory of timed automata
- On quantitative analysis of attack-defense trees with repeated labels
- Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools
- Quantitative Attack Tree Analysis via Priced Timed Automata
- Statistical Model Checking for Networks of Priced Timed Automata
- AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
- Modelling Attack-defense Trees Using Timed Automata
- Parametric real-time reasoning
- Attack-defense trees
This page was built for publication: Parametric Analyses of Attack-fault Trees*
