Computer Science – Logic in Computer Science
Scientific paper
2010-06-08
EPTCS 25, 2010, pp. 103-117
Computer Science
Logic in Computer Science
Scientific paper
10.4204/EPTCS.25.12
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.
Dima Cătălin
Enea Constantin
Guelev Dimitar
No associations
LandOfFree
Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-29347