The document discusses combining branching time logic with logics of knowledge for reasoning about multi-agent systems. It proposes an update and abstraction algorithm for model checking Computational Tree Logic with Knowledge (Act-CTL-K) in perfect recall synchronous settings. The key points are:
1) The algorithm transforms Act-CTL-K formulas of bounded knowledge depth k into Act-CTL, using k-trees and knowledge update functions to represent the original environment.
2) A k-tree is a finite tree of height k that represents the knowledge of agents. Knowledge update functions are defined to transform k-trees after actions.
3) The resulting model checking algorithm solves Act-CTL on the transformed k-trees,
The document discusses combining branching time logic with logics of knowledge for reasoning about multi-agent systems. It proposes an update and abstraction algorithm for model checking Computational Tree Logic with Knowledge (Act-CTL-K) in perfect recall synchronous settings. The key points are:
1) The algorithm transforms Act-CTL-K formulas of bounded knowledge depth k into Act-CTL, using k-trees and knowledge update functions to represent the original environment.
2) A k-tree is a finite tree of height k that represents the knowledge of agents. Knowledge update functions are defined to transform k-trees after actions.
3) The resulting model checking algorithm solves Act-CTL on the transformed k-trees,