ATL with strategy contexts: Expressiveness and Model Checking.

Arnaud da Costa (1) , François Laroussinie (2) , Nicolas Markey (1)

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

We study the alternating-time temporal logics ATL and ATL* extended with strategy contexts: these make agents commit to their strategies during the evaluation of formulas, contrary to plain ATL and ATL* where strategy quantifiers reset previously selected strategies. We illustrate the important expressive power of strategy contexts by proving that they make the extended logics, namely ATLsc and ATLsc*, equally expressive: any formula in ATLsc* can be translated into an equivalent, linear-size ATLsc formula. Despite the high expressiveness of these logics, we prove that they remain decidable by designing a tree-automata-based algorithm for model-checking ATLsc on the full class of n-player concurrent game structures.

Domaines: Logique en informatique [cs.LO]

Arnaud da Costa, François Laroussinie, Nicolas Markey. ATL with strategy contexts: Expressiveness and Model Checking.. 30th {C}onference on {F}oundations of {S}oftware {T}echnology and {T}heoretical {C}omputer {S}cience ({FSTTCS}'10), Dec 2010, Chennai, India. pp.120-132, ⟨10.4230/LIPIcs.FSTTCS.2010.120⟩. ⟨hal-00599764⟩