Exponential improvement of time complexity of model checking for multiagent systems with perfect recall

Abstract

The model checking algorithm for a combination of the computation tree logic (CTL) and the propositional logic of knowledge (PLK) in multiagent systems with perfect recall is revised. The proposed approach is based on data structures that are exponentially smaller than the structures used in the previous version of this checking algorithm. Thus, the time complexity of this algorithm is exponentially reduced.