适用于CTL * 的更快Tableau
A Faster Tableau for CTL*
摘要:
最近有几个关于tableau系统的建议,用于确定在实际重要的分支时间时态逻辑(称为CTL*)中的可满足性。在本文中,我们提出了一个简化的和更传统的tableau方法建立在作者的早期理论工作。证明了结果的可靠性和完备性。一个原型的实施表明,显着提高性能的新方法的测试公式的范围。我们还看到,它比较有利的最先进的,游戏和自动机为基础的决策程序。
英文摘要:
There have been several recent suggestions for tableau systems for deciding satisfiability in the practically important branching time temporal logic known as CTL*. In this paper we present a streamlined and more traditional tableau approach built upon the author's earlier theoretical work. Soundness and completeness results are proved. A prototype implementation demonstrates the significantly improved performance of the new approach on a range of test formulas. We also see that it compares favourably to state of the art, game and automata based decision procedures.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。