An applicable topology-independent model for railway interlocking systems
Selected papers from the 1996 or 1997 IMACS-ACA conference on Non-standard applications of computer algebra
Railway interlocking systems and Gröbner bases
Mathematics and Computers in Simulation - Selected papers from the IMACS-ACA sponsored conferences: “Non-standard applications of computer algegra II&rdqu; (held in Waileau Maui, Hawaii and Prague, Czech Republic)
An Application of an AI Methodology to Railway Interlocking Systems Using Computer Algebra
IEA/AIE '98 Proceedings of the 11th International Conference on Industrial and Engineering Applications of Artificial In telligence and Expert Systems: Tasks and Methods in Applied Artificial Intelligence
Tool support for checking railway interlocking designs
SCS '05 Proceedings of the 10th Australian workshop on Safety critical systems and software - Volume 55
Original article: A component-based topology model for railway interlocking systems
Mathematics and Computers in Simulation
A DEVS library for rail operations simulation
Proceedings of the 2011 Emerging M&S Applications in Industry and Academia Symposium
A logic-algebraic approach to decision taking in a railway interlocking system
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Railway interlocking systems are apparatuses that prevent conflicting movements of trains through an arrangement of tracks. A railway interlocking system takes into consideration the position of the switches (of the turnouts) and does not allow trains to be given clear signals unless the routes to be used by the trains do not intersect. A new model, based on Boolean Logic, and independent from the topology of the station is presented in this paper. According to this new model, any given proposed situation is safe if and only if a certain set of formulae (translating the position of trains and the movements allowed - the latter depend on the position of the switches and the colour of the semaphores) is consistent. The main procedure analyses the safety of a proposed situation and returns, if they exist, the sections where a collision could take place. The fact that trains could occupy more than one section is considered. The code of the corresponding Maple implementation is surprisingly brief.