通信学报2018,Vol.39Issue(12):82-90,9.DOI:10.11959/j.issn.1000-436x.2018275
面向车车通信的安全计算机时间约束性分析验证
Analysis and verification of safety computer time constraints for train-to-train communications
高莺 1曹源 2孙永奎 3马连川 2洪春华 3张玉琢3
作者信息
- 1. 中国铁道科学研究院研究生部,北京 100081
- 2. 北京交通大学轨道交通运行控制系统国家工程研究中心,北京 100044
- 3. 北京交通大学电子信息工程学院,北京 100044
- 折叠
摘要
Abstract
In order to adapt to the development trend of the communication based train control (CBTC) system from train-ground communication mode to train-to-train communication mode, a verification approach for time constraints of multi-period applications concurrence on-board safety computer based on time Petri net was proposed. By taking the double 2 out of 2 on-board safety computer as an example, the multi-period applications concurrence nature of the safety computer was analyzed. Time Petri net (TPN) was utilized to calculate the time schedulable interval. Then several cases were analyzed based on the inference of this approach. The analysis and verification results indicate that onboard safety computer can meet the time constraints of more than three periodic safety-critical applications under the condition of single-core with main frequency of 1GHz, which demonstrates the effectiveness of verifying and evaluating the time constraints of safety computer periodic applications using TPN.关键词
时间Petri网/车车通信/安全计算机/时间约束Key words
time Petri net/ train-to-train communication/ safety computer/ time constraint分类
交通工程引用本文复制引用
高莺,曹源,孙永奎,马连川,洪春华,张玉琢..面向车车通信的安全计算机时间约束性分析验证[J].通信学报,2018,39(12):82-90,9.