Subset sabotage games & attack graphs - Equipe Autonomic and Critical Embedded Systems Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Subset sabotage games & attack graphs

Résumé

We consider an extended version of sabotage games played over Attack Graphs. Such games are two-player zero-sum reachability games between an Attacker and a Defender. This latter player can erase particular subsets of edges of the Attack Graph. To reason about such games we introduce a variant of Sabotage Modal Logic (that we call Subset Sabotage Modal Logic) in which one modality quantifies over non-empty subset of edges. We show that we can characterize the existence of winning Attacker strategies by formulas of Subset Sabotage Modal Logic.
Fichier principal
Vignette du fichier
paper16.pdf (384.25 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-04336385 , version 1 (12-12-2023)

Licence

Identifiants

  • HAL Id : hal-04336385 , version 1

Citer

Davide Catta, Jean Leneutre, Vadim Malvone. Subset sabotage games & attack graphs. WOA 2022 - 23rd Workshop From Objects to Agents, Sep 2022, Genova, Italy. ⟨hal-04336385⟩
143 Consultations
21 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More