作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (15): 33-35. doi: 10.3969/j.issn.1000-3428.2007.15.012

• 博士论文 • 上一篇    下一篇

联锁逻辑形式化模型检验的研究

杜军威1,2,徐中伟1,宋 波3   

  1. (1. 同济大学电子与信息工程学院,上海 200331;2. 青岛科技大学信息科学技术学院,青岛 266061; 3. 上海大学计算机学院,上海 200072)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-08-05 发布日期:2007-08-05

Research on Formal Model Checking of Interlocking Logic

DU Jun-wei1,2, XU Zhong-wei1, SONG Bo3   

  1. (1. School of Electronics & Information Engineering, Tongji University, Shanghai 200331; 2. School of Information Science and Technology , Qingdao University of Science and Technology, Qingdao 266061; 3. School of Computer Science, Shanghai University, Shanghai 200072)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-08-05 Published:2007-08-05

摘要: 利用自动机理论模型检验算法,检验车站联锁逻辑的有色Petri网模型是否满足预期的性能。通过采用带标签的广义Büchi自动机(LGBA)构建线性时态逻辑,有效地解决了模型检验中的状态空间爆炸问题。该方法的研究增强了有色Petri网的分析和验证能力,利用该方法对车站联锁逻辑的实际问题进行了性能验证。

关键词: 有色Petri网, 线性时态逻辑, 带标签的广义Büchi自动机, 联锁逻辑

Abstract: A method about automata-theoretic model checking is presented. This method is used to verify the property of color Petri nets(CPN) model of interlocking logic. State space exposition can be solved efficiently by constructing linear-time temporal logic(LTL) with labeled generalized Büchi automaton(LGBA) in model checking. This method improves the analysis and checking of CPN. A practical case of the railway interlocking logic is checked by this method.

Key words: colored Petri nets, linear-time temporal logic, labeled generalized Büchi automaton, interlocking logic

中图分类号: