计算机应用研究2009，Vol.26Issue(8)：3039-3043,5.DOI:10.3969/j.issn.1001-3695.2009.08.070
改进的最小割集生成算法与联锁系统模型的安全性测试
Improved algorithm of generation for smallest cut sets and safety testing of interlocking system model
摘要
Abstract
In order to ensure the safety of the railway interlocking system model, on the base of the method of fault tree analysis, this paper proposed a new method of establishing the fault tree with Petri net which could describe the interlocking system safety requirement dynamically. It also presented an algorithm to get the smallest cut sets automatically based on the reachable marking graph of the Petri net model. Furthermore, designed an interlocking safety detector to detect the interlocking system model whether was in a safe state. Finally, adopted CPN tools, a coloured Petri net simulation tool, to evaluate the safety of the model for interlocking system safety requirement. The simulation results show that the safety of the model can be guaranteed by the detector.关键词
联锁系统/故障树分析/最小割集/Petri网/联锁安全检测器/安全测试Key words
interlocking system/fault tree analysis(FTA)/smallest cut sets/Petri net/interlocking safety detector/safety testing分类
信息技术与安全科学引用本文复制引用
张福新,杜玉越..改进的最小割集生成算法与联锁系统模型的安全性测试[J].计算机应用研究,2009,26(8):3039-3043,5.基金项目
国家自然科学基金资助项目(60773034) （60773034）
国家"973"计划资助项目(2004CB318001-03) （2004CB318001-03）
中国科学院计算机科学国家重点实验室开放课题资助项目(SYSKF0804) （SYSKF0804）
山东省"泰山学者"建设工程专项经费资助项目 （）
