3 papers
cs.DS2026
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…
math.GM2026
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…
cs.CR2025
A Unified Compositional View of Attack Tree Metrics
Benedikt Peterseim, Milan Lopuhaä-Zwakenberg
Attack trees (ATs) are popular graphical models for reasoning about the security of complex systems, allowing for the quantification of risk through so-called AT metrics. A large v…