Decision making in railway interlocking systems based on calculating the remainder of dividing a polynomial by a set of polynomials

Abstract

Decision-making in a railway station regarding the compatibility of the positions of the switches of the turnouts and the indications (proceed/stop) of the railway colour light signals is a safety-critical issue that is considered very labor-intensive. Different authors have proposed alternative solutions to automate its supervision, which is performed by the so-called railway interlocking systems. The classic railway interlocking systems are route-based and their compatibility is predetermined (usually by human experts): only some chosen routes are simultaneously allowed. Some modern railway interlocking systems are geographical and make decisions on the fly, but are unsuitable if the station is very large and the number of trains is high. In this paper, we present a completely new algebraic model for decision-making in railway interlocking systems, based on other computer algebra techniques, that bypasses the disadvantages of the approaches mentioned above (its performance does not depend on the number of trains in the railway station and can be used in large railway stations). The main goal of this work is to provide a mathematical solution to the interlocking problems. We prove that our approach solves it in linear time. Although our approach is interesting from a theoretical perspective, it has a significant limitation: it can hardly be adopted in an actual interlocking implementation, mainly due to the heavy certification requirements for this kind of safety-critical application. Nevertheless, the results may be useful for simulations that do not require certification credit.

Keywords

• railway interlocking system
• computer algebra
• decision making
• groebner bases
• commutative algebra