Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic.

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1(2010)

引用 11|浏览1
暂无评分
摘要
The paper develops a new approach to bounded model checking for a logic of knowledge and branching time. Experimental results are presented that demonstrate improved model checking performance, compared with previous approaches, on a range of examples.
更多
查看译文
关键词
bounded model checking,model checking performance,experimental result,new approach,previous approach,Improved bounded model checking,fair branching-time temporal epistemic
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要