In earlier work, we presented translations of attack-defence trees (ADTrees) to extended
asynchronous multi-agent systems. By avoiding some sequences, agent models constructed
via these transformations already embed state space reductions. Here, we introduce
Guarded Update Systems and their synchronisation topology, allowing us to define a new
general reduction scheme that applies to tree topologies, and in particular to ADTrees. The
reduction exploits the layered structure of a tree by avoiding unnecessary interleavings …

… ▶ Build the EAMAS by replacing each ADTree node by an automaton ▶ State space
explosion … Summary ▶ A framework for model-checking systems that manipulate data ▶
Layered reduction approach to harness state space explosion ▶ Gains confirmed by
extensive experiments on Attack-Defence Trees … Summary ▶ A framework for model-checking
systems that manipulate data ▶ Layered reduction approach to harness state space
explosion ▶ Gains confirmed by extensive experiments on Attack-Defence Trees …