Modelling Attack-defense Trees Using Timed Automata

DOI10.1007/978-3-319-44878-7_3zbMath1433.68251OpenAlexW2515420228MaRDI QIDQ4603556

René Rydhof Hansen, Axel Legay, Mads Chr. Olesen, Danny Bøgsted Poulsen, Olga Gadyatskaya, Kim Guldstrand 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

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) Computer security (68M25)

Related Items (2)

Is my attack tree correct? ⋮ Parametric Analyses of Attack-fault Trees*

This page was built for publication: Modelling Attack-defense Trees Using Timed Automata