Expressing attack-defence trees in a multi-agent setting allows for studying a new aspect of security scenarios, namely how the number of agents and their task assignment impact the performance, e.g. attack time, of strategies executed by opposing coalitions. Optimal scheduling of agents' actions, a non-trivial problem, is thus vital. We discuss associated caveats and propose an algorithm that synthesises such an assignment, targeting minimal attack time and using minimal number of agents for a given attack-defence tree.

翻译：在多试剂环境下表达攻击防御树有助于研究安全设想的一个新方面,即代理人的数目及其任务分配如何影响敌对联盟所执行的战略的性能,例如攻击时间。因此,最佳地安排代理人的行动是一个非三重问题,因此至关重要。我们讨论相关的警告,并提出一种算法,将这种任务合成,针对最低限度的攻击时间,为特定的攻击防御树使用最低数量的代理人。