We develop a framework for probabilistic analysis of security scenarios with dependencies.

We combine the security model of attack–defense trees (ADTrees) with Bayesian networks.

We prove that propositionally equivalent ADTrees yield the same probability value.

We compare our computational method with the standard bottom-up algorithm for ADTrees.

We use semiring theory to improve the efficiency of our computations.