1 citations · 1 across the 7 of their papers we have counts for
7 papers
Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation
Benedikt Peterseim, Milan Lopuhaä-Zwakenberg
Discrete probabilistic programs (DPPs) provide a highly expressive formalism for compactly defining arbitrary finite probabilistic models. This expressivity comes at a price: DPP i…
Querying Attack-Fault-Defense Trees: Property Specification in Smart Grid and Aerospace Case Studies
Reza Soltani, Stefano M. Nicoletti, Milan Lopuhaä-Zwakenberg +1
This paper introduces AFDL, a logic-based framework for reasoning about safety, security, and defense interactions in Attack-Fault-Defense Trees, which is a model that captures all…
Fuzzy Fault Trees: the Fast and the Formal
Thi Kim Nhung Dang, Benedikt Peterseim, Milan Lopuhaä-Zwakenberg +1
We provide a rigorous framework for handling uncertainty in quantitative fault tree analysis based on fuzzy theory. We show that any algorithm for fault tree unreliability analysis…
Attack-Defense Trees with Offensive and Defensive Attributes (with Appendix)
Danut-Valentin Copae, Reza Soltani, Milan Lopuhaä-Zwakenberg
Effective risk management in cybersecurity requires a thorough understanding of the interplay between attacker capabilities and defense strategies. Attack-Defense Trees (ADTs) are…
Safety and Security Risk Mitigation in Satellite Missions via Attack-Fault-Defense Trees
Reza Soltani, Pablo Diale, Milan Lopuhaä-Zwakenberg +1
Cyber-physical systems, such as self-driving cars or digitized electrical grids, often involve complex interactions between security, safety, and defense. Proper risk management st…
How hard can it be? Quantifying MITRE attack campaigns with attack trees and cATM logic
Stefano M. Nicoletti, Milan Lopuhaä-Zwakenberg, Mariëlle Stoelinga +2
The landscape of cyber threats grows more complex by the day. Advanced Persistent Threats carry out attack campaigns - e.g. operations Dream Job, Wocao, and WannaCry - against whic…