期刊文献+

基于项重写系统的联锁系统模型检测方法研究

Research on modeling and verification methods of interlocking system based on term rewriting system
在线阅读 下载PDF
导出
摘要 模型检测方法对安全苛求系统建模的完整性需要一套严谨的方法论与技术,对于验证系统的正确性,具有传统方法无法比拟的优势。提出利用项重写系统建立安全苛求系统模型与验证方法,采用基于项重写系统原理的Maude工具语言,对铁路联锁系统的站场进行形式化建模,通过其语法和语义定义各类约束和离散事件,构架联锁系统属性和行为。在模型建立的基础上,对联锁站场的静态属性和安全属性进行形式化模型验证。结果表明,基于项重写系统的模型检测方法可以较好地应用于实际联锁系统软件的开发,对开发安全苛求系统和模型检测方法的实际应用提供借鉴。 Modeling and verification methods require a rigorous methodology and technology for the integrity of the safety-critical system modeling, which have incomparable advantages on the correctness, compared with the traditional methods. This paper proposes a method of using the Term Rewriting System to build the model, and using Maude based on Term Rewriting System to ensure the formal description and verification of interlocking system. With the syntax and semantics of Maude, the specification of various types of constraints and discrete events constitutes the properties and behavior of the interlock system. The safety properties and static properties of interlocking station are validated on the basis of formalized model. The result shows that the modeling and verification methods based on Term Rewriting System can be used for the verification of interlocking systems scalability, and this research provides a good reference for the formal modeling and verification of the safety-critical system.
出处 《计算机工程与应用》 CSCD 2014年第3期49-54,共6页 Computer Engineering and Applications
基金 国家自然科学基金(No.60674004) 国家高技术研究发展计划(863)(No.2012AA112801) 国家十二五科技支撑项目(No.2011BAG01B03)
关键词 项重写系统 联锁 Maude语言 安全苛求系统 模型检测 Term Rewriting System interlocking system Maude safety-critical system model checking
  • 相关文献

参考文献8

二级参考文献43

  • 1陈邦兴,吴芳美.铁路信号控制逻辑的有色Petri网描述方法[J].铁道学报,2001,23(z1):54-58. 被引量:4
  • 2周博,王石记,邱卫东,彭澄廉.SHUM-UCOS:基于统一多任务模型可重构系统的实时操作系统[J].计算机学报,2006,29(2):208-218. 被引量:33
  • 3杜军威,徐中伟,王树梅.联锁逻辑模型的安全性分析[J].计算机工程与应用,2007,43(2):1-4. 被引量:12
  • 4JIANG J H, BRAYTO R K. On the verification of sequential equivalence [J].IEEE Trans CAD Integr Circ and Syst, 2003, 22(6): 686-697.
  • 5VAN EIJK C A J. Sequential equivalence checking based on structural similarities [J]. IEEE Trans CAD Integr Circ and Syst, 2000, 19(7): 814-819.
  • 6KOZEN D. Kleene algebra with tests [J]. ACM Trans Programming Languages and Systems, 1997, 19 (3): 427-443.
  • 7BAADER F, NIPKOW T. Term rewriting and all that [M]. Cambridge: Cambridge University Press, 1998.
  • 8ZHENG Z,WATNE B. Equivalence checking of datapaths based on canonical arithmetic expressions [C] // Proc 32nd DAC. San Francisco,USA. 1995: 546-551.
  • 9VASUDEVAN S, VISWANATH V, SUMNERS R W, et al. Automatic verification of arithmetic circuits in RTL using stepwise refinement of term rewriting systems [J]. IEEE Trans Computers, 2007, 56 (10): 1401-1414.
  • 10CARETTE J,JANICKI R, ZHAI Y. Program verification by calculating relations [C] // Proc 15th IASTEAD Conf Applied Simulation and Modeling. Rhodes,Greece. 2006: 151-156.

共引文献41

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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