  Railway scheduling is a problem that exhibits both non-trivial discrete and
continuous behavior. In this paper, we simulate train networks at a low level,
where a number of timing and ordering constraints can appear. We model this
problem using a combination of SAT and ordinary differential equations (SAT
modulo ODE). In addition, we adapt our existing method for solving such
problems in such a way that the resulting solver is competitive with methods
based on dedicated railway simulators while being more general and extensible.
