arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0810.5516cs.LO
收藏

有理Kripke模型上时态逻辑的符号模型检验

Symbolic model checking of tense logics on rational Kripke models

Wilmari Bekker, Valentin Goranko

摘要:

本文引入了有理Kripke模型类,研究了基本时态逻辑Kt的符号模型检验及其在该类模型中的一些扩展。有理Kripke模型基于(通常是无限的)有理图,顶点由某些正则语言中的单词标记,转换由异步双头有限自动机(也称为有理转换器)识别。在理性Kripke模型中,每个原子命题都在一组规则的状态中求值。证明了Kt的每个公式在每个有理Kripke模型中都有一个有效的可计算正则扩张,从而证明了有理Kripke模型中Kt的局部模型检验和全局模型检验是可判定的.这些结果被提升到Kt的一些扩展。我们研究并部分确定了模型检验过程的复杂性。

英文摘要:

We introduce the class of rational Kripke models and study symbolic model checking of the basic tense logic Kt and some extensions of it in models from that class. Rational Kripke models are based on (generally infinite) rational graphs, with vertices labeled by the words in some regular language and transitions recognized by asynchronous two-head finite automata, also known as rational transducers. Every atomic proposition in a rational Kripke model is evaluated in a regular set of states. We show that every formula of Kt has an effectively computable regular extension in every rational Kripke model, and therefore local model checking and global model checking of Kt in rational Kripke models are decidable. These results are lifted to a number of extensions of Kt. We study and partly determine the complexity of the model checking procedures.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑