Abstract
In railway simulation, given timetables have to be checked against various criteria, mainly correctness and robustness. Most existing approaches use classical centralized simulation techniques. This work goes beyond that in two main aspects: We use constraint satisfaction to get rid of deadlock problems and the simulation is done distributedly for better performance. This should make it possible to solve very large railway simulation problems. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Schlenker, H. (2005). Distributed constraint-based railway simulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3392 LNAI, pp. 215–226). Springer Verlag. https://doi.org/10.1007/11415763_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
