Cătălin Dima (LACL, Université Paris-Est Créteil) |
Constantin Enea (LIAFA, CNRS UMR 7089, Université Paris Diderot - Paris 7) |
Dimitar Guelev (Section of Logic, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences) |
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. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.25.12 | bibtex | |
Comments and questions to:
![]() |
For website issues:
![]() |