Open-source research tool

ADT2AMAS

ADT2AMAS translates Attack–Defence Trees into extended Asynchronous Multi-Agent Systems, then finds an optimal schedule using the fewest agents.

C++ core engine GPL-3.0 licensed Research-backed algorithms
Attack–Defence Tree
GOALCompromise
system
ATTACKGain access
DEFENCEContain threat
A1exploit()
A2escalate()
A3monitor()
A4isolate()
Optimal schedule found 4 agents

One model, executable semantics

From structure to strategy

Bridge high-level security modeling and concrete agent coordination through a rigorous, automated workflow.

01

Model the scenario

Express attacker objectives, defensive countermeasures, and their dependencies as an Attack–Defence Tree.

ADT input
03

Optimise the plan

Compute a valid execution schedule while minimising the number of agents needed to reach the objective.

Optimal schedule

Built for research, ready to use

Everything you need to explore coordinated security scenarios

03

Publications

Implemented algorithms are supported by scientific publications.

See Publications

See it in action

A complete translation, step by step.

Watch how an Attack–Defence Tree becomes a multi-agent execution model and how ADT2AMAS derives an optimal schedule.

Try the graphical interface