A computer algebra approach to the design of routes and the study of their compatibility in a railway interlocking

DOI10.1016/S0378-4754(01)00371-8zbMath1015.68203OpenAlexW2037083342WikidataQ126590715 ScholiaQ126590715MaRDI QIDQ1349163

Eugenio Roanes-Lozano, Eugenio Roanes-Macías, Luis M. Laita

Publication date: 21 May 2002

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-4754(01)00371-8

zbMATH Keywords

Mapleknowledge extractionrailway interlocking

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (2)

Revisiting the 7/23 train accident using computer reconstruction simulation for causation and prevention analysis ⋮ An algebraic approach to DC railway electrification verification

Uses Software

• Maple

Cites Work

• A polynomial model for multi-valued logics with a touch of algebraic geometry and computer algebra
• An applicable topology-independent model for railway interlocking systems
• Unnamed Item

This page was built for publication: A computer algebra approach to the design of routes and the study of their compatibility in a railway interlocking