Quantitative attack tree analysis via priced timed automata
DOI10.1007/978-3-319-22975-1_11zbMATH Open1465.68034OpenAlexW2096349415MaRDI QIDQ2945593FDOQ2945593
Authors: Rajesh Kumar, Enno Ruijters, 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
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computer security (68M25)
Cites Work
- A theory of timed automata
- Lectures on Concurrency and Petri Nets
- DAG-based attack and defense modeling: don't miss the forest for the attack trees
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Formal Methods for Components and Objects
- Title not available (Why is that?)
- Information Security and Cryptology - ICISC 2005
- Weighted timed automata: model-checking and games
Cited In (5)
Uses Software
This page was built for publication: Quantitative attack tree analysis via priced timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945593)