Abstract
We present a variant of ATL with distributed knowledge operators based on a synchronous and perfect recall semantics. The coalition modalities in this logic are based on partial observation of the full history, and incorporate a form of cooperation between members of the coalition in which agents issue their actions based on the distributed knowledge, for that coalition, of the system history. We show that model-checking is decidable for this logic. The technique utilizes two variants of games with imperfect information and partially observable objectives, as well as a subset construction for identifying states whose histories are indistinguishable to the considered coalition.
| Original language | English |
|---|---|
| Pages (from-to) | 103-117 |
| Number of pages | 15 |
| Journal | Electronic Proceedings in Theoretical Computer Science, EPTCS |
| Volume | 25 |
| DOIs | |
| Publication status | Published - 9 Jun 2010 |
| Externally published | Yes |
| Event | 1st Symposium on Games, Automata, Logic, and Formal Verification, G and ALF 2010 - Minori (Amalfi Coast), Italy Duration: 17 Jun 2010 → 18 Jun 2010 |
Fingerprint
Dive into the research topics of 'Model-checking an alternating-time temporal logic with knowledge, imperfect information, perfect recall and communicating coalitions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver