Attack Graphs & Subset Sabotage Games - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Intelligenza Artificiale Année : 2023

Attack Graphs & Subset Sabotage Games

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 non déposé

Dates et versions

hal-04336220 , version 1 (11-12-2023)

Identifiants

Citer

Davide Catta, Jean Leneutre, Vadim Malvone. Attack Graphs & Subset Sabotage Games. Intelligenza Artificiale, 2023, 17 (1), pp.77-88. ⟨10.3233/IA-221080⟩. ⟨hal-04336220⟩
43 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More