DeepAI AI Chat
Log In Sign Up

Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees

by   Jaime Arias, et al.

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.


Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-Agent Systems

Attack-Defence Trees (ADTs) are well-suited to assess possible attacks t...

Attack time analysis in dynamic attack trees via integer linear programming

Attack trees are an important tool in security analysis, and an importan...

Robust Multi-Agent Task Assignment in Failure-Prone and Adversarial Environments

The problem of assigning agents to tasks is a central computational chal...

Attribute Evaluation on Attack Trees with Incomplete Information

Attack trees are considered a useful tool for security modelling because...

Maximal Exploration of Trees with Energy-Constrained Agents

We consider the problem of exploring an unknown tree with a team of k in...

On Minimal Change in Evolving Multi-Context Systems (Preliminary Report)

Managed Multi-Context Systems (mMCSs) provide a general framework for in...

Adversarial Formal Semantics of Attack Trees and Related Problems

Security is a subject of increasing attention in our actual society in o...