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

证明的力量:时间自动机模型检验的新算法(附附录)

The Power of Proofs: New Algorithms for Timed Automata Model Checking (with Appendix)

Peter Fontana, Rance Cleaveland

摘要:

本文提出了第一个模型检测算法的表达模态μ演算的时间自动机,$L^{\mathit{rel}, \mathit{af}}_{ν,μ}$,并报告性能结果的实现。该μ演算包含扩展的时间模态算子,可以表示所有的TCTL。我们的算法方法使用了一个“在飞”的基础上证明搜索的策略,作为一种手段,确保高性能的积极和消极的答案模型检查问题。特别是,一组证明规则解决模型检查问题,并证明了健全和完整的,我们编码我们的算法在这些证明规则和模型检查的属性,通过构建一个证明(或显示不存在)使用这些规则。我们的技术的一个值得注意的方面是,我们表明,验证性能可以提高与\emph{derived rules},其正确性可以推断出更原始的规则,他们是基于。在本文中,我们给出了基本的证明规则,我们的方法,描述派生的证明规则,以提高性能,并比较我们的实现这个模型检查器的UPPAAL工具。

英文摘要:

This paper presents the first model-checking algorithm for an expressive modal mu-calculus over timed automata, $L^{\mathit{rel}, \mathit{af}}_{ν,μ}$, and reports performance results for an implementation. This mu-calculus contains extended time-modality operators and can express all of TCTL. Our algorithmic approach uses an "on-the-fly" strategy based on proof search as a means of ensuring high performance for both positive and negative answers to model-checking questions. In particular, a set of proof rules for solving model-checking problems are given and proved sound and complete; we encode our algorithm in these proof rules and model-check a property by constructing a proof (or showing none exists) using these rules. One noteworthy aspect of our technique is that we show that verification performance can be improved with \emph{derived rules}, whose correctness can be inferred from the more primitive rules on which they are based. In this paper, we give the basic proof rules underlying our method, describe derived proof rules to improve performance, and compare our implementation of this model checker to the UPPAAL tool.

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

↑