Modelling attack-defense trees using timed automata

DOI10.1007/978-3-319-44878-7_3MaRDI QIDQ4603556zbMATH OpenOpenAlexFDO

Authors Olga Gadyatskaya, René Rydhof Hansen, Axel Legay, Mads Chr. Olesen, Danny Bøgsted Poulsen, Kim G. Larsen

Publication date 16 February 2018

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

Full work available at URL https://hal.inria.fr/hal-01406706/file/formats2016.pdf

Mathematics Subject Classification ID

Computer security (68M25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Attack-defense trees
• Parametric analyses of attack-fault trees
• Quantitative attack tree analysis via priced timed automata
• Model Checking Exact Cost for Attack Scenarios
• Information Security and Cryptology - ICISC 2005

Cited in

(8)

• Is my attack tree correct?
• Modeling attack-defense trees' countermeasures using continuous time Markov chains
• Quantitative attack tree analysis via priced timed automata
• Parametric analyses of attack-fault trees
• Attack-defense trees
• Expected Cost Analysis of Attack-Defense Trees
• Semantics of attack-defense trees for dynamic countermeasures and a new hierarchy of star-free languages
• Tamper-tolerant diagnosability analysis and tampering detectability in discrete event systems under cost constraints

This page was built for publication: Modelling attack-defense trees using timed automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603556)