作者: Xiaowei Huang
DOI: 10.1016/J.ARTINT.2015.01.005
关键词:
摘要: The paper works with a logic which has the expressiveness to quantify over strategies of bounded length. semantics is based on systems multiple agents. Agents have incomplete information about underlying system state and their are perfect recall memory observations local actions. computational complexity model checking shown be PSPACE-complete. We give two BDD-based algorithms. algorithms implemented in checker experimental results reported show applications.