Model Checking Strategic Abilities of Agents Under Incomplete Information

2005 ◽  
pp. 295-308 ◽  
Author(s):  
Wojciech Jamroga ◽  
Jürgen Dix
Keyword(s):  
Model Checking ◽  
Incomplete Information

scholarly journals Model Checking Temporal Epistemic Logic under Bounded Recall

2020 ◽  
Vol 34 (05) ◽  
pp. 7071-7078
Author(s):  
Francesco Belardinelli ◽  
Alessio Lomuscio ◽  
Emily Yu
Keyword(s):  
Model Checking ◽  
Incomplete Information ◽  
Epistemic Logic ◽  
Upper Bounds ◽  
Experimental Results ◽  
Model Checker ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Bounded Recall

We study the problem of verifying multi-agent systems under the assumption of bounded recall. We introduce the logic CTLKBR, a bounded-recall variant of the temporal-epistemic logic CTLK. We define and study the model checking problem against CTLK specifications under incomplete information and bounded recall and present complexity upper bounds. We present an extension of the BDD-based model checker MCMAS implementing model checking under bounded recall semantics and discuss the experimental results obtained.

Averaging of temporal memories under conditions of incomplete information

2011 ◽  
Author(s):  
Joseph Leman ◽  
Matthew S. Matell ◽  
Michael Brown
Keyword(s):  
Incomplete Information
Sign in / Sign up

Export Citation Format

Share Document