Quantitative Attack Tree Analysis via Priced Timed Automata

DOI10.1007/978-3-319-22975-1_11zbMath1465.68034OpenAlexW2096349415MaRDI QIDQ2945593

Enno Ruijters, Rajesh Kumar, Mariëlle I. A. Stoelinga

Publication date: 14 September 2015

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-22975-1_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computer security (68M25)

Related Items (4)

Attack trees vs. fault trees: two sides of the same coin from different currencies ⋮ Is my attack tree correct? ⋮ Model Checking Exact Cost for Attack Scenarios ⋮ Parametric Analyses of Attack-fault Trees*

Uses Software

• Uppaal
• UPPAAL CORA

Cites Work

• Unnamed Item
• Unnamed Item
• DAG-based attack and defense modeling: don't miss the forest for the attack trees
• A theory of timed automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Lectures on Concurrency and Petri Nets
• Formal Methods for Components and Objects
• Information Security and Cryptology - ICISC 2005

This page was built for publication: Quantitative Attack Tree Analysis via Priced Timed Automata