基于图论的联锁程序的研究与设计

研究了作为计算机联锁系统核心的联锁程序的设计问题。分析了联锁程序需要处理的基本问题。为了将图论中解决问题的基本方法应用到这些问题的解释上，对几个最基本的概念作出严格的数学定义。在此基础之上，又对结点的封闭、释放和如何选择安全的路径作了进一步的分析。提出了一种新的联锁程序的设计思路。通过实验，验证了提出的方法是符合安全条件的。并与现行的联锁程序进行对比后发现，以该理论为基础设计的程序有数据量小，算法通用和可移植性好等诸多优点。

Design of interlocking program on graph theory

This paper focuses on the design problem of the interlocking program, which is the core part of computer interlocking system. The most essential problem of the interlocking program is analyzed. To apply the basic method of graph on this issue, the strict mathematical definition of some basic conception is given. Based on these, it is analyzed how to capture and release a node, and how to find a safe route. A new scheme of interlocking program is presented. The experiments on real data prove that the method presented is safe. And compared with the present interlocking system, the program based on the paper has many advantages, such as less data and better portability.