Résumé
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.
| langue originale | Anglais |
|---|---|
| Pages (de - à) | 103-117 |
| Nombre de pages | 15 |
| journal | Electronic Proceedings in Theoretical Computer Science, EPTCS |
| Volume | 25 |
| Les DOIs | |
| état | Publié - 9 juin 2010 |
| Modification externe | Oui |
| Evénement | 1st Symposium on Games, Automata, Logic, and Formal Verification, G and ALF 2010 - Minori (Amalfi Coast), Italie Durée: 17 juin 2010 → 18 juin 2010 |
Empreinte digitale
Examiner les sujets de recherche de « Model-checking an alternating-time temporal logic with knowledge, imperfect information, perfect recall and communicating coalitions ». Ensemble, ils forment une empreinte digitale unique.Contient cette citation
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver