Non-elementary speed up for model checking synchronous perfect recall

Authors:
Mika Cohen;Alessio Lomuscio
Affiliations:
Department of Computing, Imperial College London, UK;Department of Computing, Imperial College London, UK
Venue:
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Year:
2010

Citing 1
Cited 2

Common knowledge and update in finite environments

Information and Computation

Exponential acceleration of model checking for perfect recall systems

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Exponential improvement of time complexity of model checking for multiagent systems with perfect recall

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the complexity of the model checking problem for the logic of knowledge and past time in synchronous systems with perfect recall. Previously established bounds are k-exponential in the size of the system for specifications with k nested knowledge modalities. We show that the upper bound for positive (respectively, negative) specifications is polynomial (respectively, exponential) in the size of the system irrespective of the nesting depth.