期刊文献+

一个命题投影时序逻辑符号模型检测器 被引量:3

Symbolic Model Checker for Propositional Projection Temporal Logic
下载PDF
导出
摘要 现有模型检测工具的形式化规范语言,如计算树逻辑(computation tree logic,简称CTL)和线性时序逻辑(linear temporal logic,简称LTL)等的描述能力不足,无法验证ω正则性质.提出了一个命题投影时序逻辑(propositional projection temporal logic,简称PPTL)符号模型检测工具——PLSMC(PPTL symbolic model checker)的设计与实现过程.该工具基于著名的符号模型检测系统NuSMV,实现了PPTL的符号模型检测算法.PLSMC的规范语言PPTL具有完全正则表达能力,这使得定性性质和定量性质均可被验证.此外,PLSMC可以有效地缓解模型检测工具中容易发生的状态空间爆炸问题.最后,利用PLSMC对铁路公路交叉道口护栏控制系统的安全性质和周期性性质进行验证.实验结果表明,PPTL符号模型检测工具扩充了NuSMV系统的验证能力,使得时间敏感、并发性和周期性等实时性质可以被描述和验证. The formal specification languages for existing model checking tools such as computation tree logic (CTL) and linear temporal logic (LTL) are not powerful enough to describe ω-regular properties, in that those properties cannot be verified with them. In this study, a design and implementation procedure of propositional projection temporal logic (PPTL) symbolic model checker (PLSMC) is developed by implementing the symbolic model checking algorithm for PPTL from author's previous work based on the acclaimed symbolic model checking system NuSMV. As PPTL has the expressive power of full-regular expressions, both qualitative and quantitative properties can be verified with PLSMC. Moreover, PLSMC is an effective model checking tool to tackle the state space explosion problem Finally, safety and iterative properties of a railway and highway crossing guardrail control system are checked with PLSMC. Experimental results show that the presented symbolic model checker for PPTL extends the validation functionality of the NuSMV system such that state sensitive, concurrent and periodic properties can be specified and verified with PPTL.
出处 《软件学报》 EI CSCD 北大核心 2015年第8期1968-1982,共15页 Journal of Software
基金 国家自然科学基金(61133001,61202038,61272117,61272118,61322202) 国家重点基础研究发展计划(973)(2010CB328102)
关键词 符号模型检测 时序逻辑 模型检测器 嵌入式系统验证 symbolic model checking temporal logic model checker embedded system verification
  • 相关文献

参考文献1

二级参考文献15

  • 1李光辉,李晓维.基于增量可满足性的等价性检验方法[J].计算机学报,2004,27(10):1388-1394. 被引量:7
  • 2王海霞,韩承德.整数乘法电路的形式化验证方法研究[J].计算机研究与发展,2005,42(3):404-410. 被引量:6
  • 3邓澍军,吴为民,边计年.RTL验证中的混合可满足性求解[J].计算机辅助设计与图形学学报,2007,19(3):273-278. 被引量:11
  • 4韩俊剐,杜慧敏.数字硬件的形式化验证[M].北京:北京大学出版社,2001.
  • 5Bryant R E. Graph-based algorithms for Boolean function manipulation [J]. IEEE Trans on Computers, 1986, C-35 (8) : 677-691
  • 6Bryant R E, Chen Y A. Verification of arithmetic circuits with binary moment diagrams [C] //Proc of the 32nd Design Automation Conf. New York: ACM, 1995:535-541
  • 7Ciesielski M, Kalla P, Askar S. Taylor expansion diagrams: A canonical representation for verification of data flow designs [J]. IEEE Trans on Computers, 2006, 55(9) : 1188- 1201
  • 8Goldberg E I, Prasad M R, Brayton R K. Using SAT for combinational equivalence checking [C] //IEEE/ACM Design, Automation and Test in Europe Conf. Piscataway, NJ: IEEE, 2001:114-121
  • 9Brinkmann R, Drechsler R. RTL datapath verification using integer linear programming [C] //Proc of the 7th Asia and South Pacific Design Automation Conf. Washington, DC: IEEE Computer Society, 2002:741-746
  • 10Smith J, Micheli G D. Polynomial circuit models for component matching in high-level synthesis [J]. IEEE Trans on VLSI Systems, 2001, 9(6): 783-800

共引文献1

同被引文献46

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部