Skip to main content
SpringerLink
Log in

Railway Scheduling Using Boolean Satisfiability Modulo Simulations

  • Conference paper
  • First Online:
Formal Methods (FM 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14000))

Included in the following conference series:

  • 958 Accesses

Abstract

Railway scheduling is a problem that exhibits both non-trivial discrete and continuous behavior. In this paper, 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Simulations of ODEs are actually not that cheap, but we currently do not have evidence that postponing them within theory propagation would be beneficial.

References

  1. Andreychuk, A., Yakovlev, K., Surynek, P., Atzmon, D., Stern, R.: Multi-agent pathfinding with continuous time. Artif. Intell. 305, 103662 (2022). https://doi.org/10.1016/j.artint.2022.103662

  2. Biere, A.: Bounded model checking. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, chap. 14, pp. 457–481. IOS Press (2009). https://doi.org/10.3233/978-1-58603-929-5-457

  3. Bournez, O., Campagnolo, M.L.: A survey on continuous time computations. In: Cooper, S., Löwe, B., Sorbi, A. (eds.) New Computational Paradigms, pp. 383–423. Springer, New York (2008). https://doi.org/10.1007/978-0-387-68546-5_17

    Chapter  Google Scholar 

  4. Brain, M., Tinelli, C., Rümmer, P., Wahl, T.: An automatable formal semantics for IEEE-754 floating-point arithmetic. In: 22nd IEEE Symposium on Computer Arithmetic, pp. 160–167. IEEE (2015), https://doi.org/10.1109/ARITH.2015.26

  5. Eggers, A., Ramdani, N., Nedialkov, N., Fränzle, M.: Improving SAT Modulo ODE for hybrid systems analysis by combining different enclosure methods. In: Barthe, G., Pardo, A., Schneider, G. (eds.) SEFM 2011. LNCS, vol. 7041, pp. 172–187. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24690-6_13

    Chapter  MATH  Google Scholar 

  6. Gao, S., Kong, S., Clarke, E.M.: dReal: an SMT solver for nonlinear theories over the reals. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 208–214. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38574-2_14

    Chapter  Google Scholar 

  7. Haehn, R., Ábrahám, E., Nießen, N.: Freight train scheduling in railway systems. In: Hermanns, H. (ed.) MMB 2020. LNCS, vol. 12040, pp. 225–241. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-43024-5_14

    Chapter  Google Scholar 

  8. Haehn, R., Ábrahám, E., Nießen, N.: Symbolic simulation of railway timetables under consideration of stochastic dependencies. In: Abate, A., Marin, A. (eds.) QEST 2021. LNCS, vol. 12846, pp. 257–275. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-85172-9_14

    Chapter  Google Scholar 

  9. Kolárik, T., Ratschan, S.: SAT modulo differential equation simulations. In: Ahrendt, W., Wehrheim, H. (eds.) TAP 2020. LNCS, vol. 12165, pp. 80–99. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-50995-8_5

    Chapter  Google Scholar 

  10. Kolárik, T., Ratschan, S.: Railway scheduling using Boolean satisfiability modulo simulations (2022). https://arxiv.org/abs/2212.05382. Extended version of the paper

  11. Kolárik, T.: UN/SOT (UN/SAT modulo ODES Not SOT) (2020). https://gitlab.com/Tomaqa/unsot

  12. Kolárik, T.: UN/SOT preprocessing language (2022). https://gitlab.com/Tomaqa/unsot/-/blob/master/doc/lang/preprocess.pdf

  13. Luteberget, B., Claessen, K., Johansen, C., Steffen, M.: SAT modulo discrete event simulation applied to railway design capacity analysis. Formal Methods Syst. Design 57(2), 211–245 (2021). https://doi.org/10.1007/s10703-021-00368-2

    Article  MATH  Google Scholar 

  14. Montigel, M.: Formal representation of track topologies by double vertex graphs. In: Proceedings of Railcomp 92 held in Washington DC, Computers in Railways 3, vol. 2. Computational Mechanics Publications (1992)

    Google Scholar 

  15. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: from an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM (JACM) 53(6), 937–977 (2006). https://doi.org/10.1145/1217856.1217859

    Article  MathSciNet  MATH  Google Scholar 

  16. Salerno, M., E-Martín, Y., Fuentetaja, R., Gragera, A., Pozanco, A., Borrajo, D.: Train route planning as a multi-agent path finding problem. In: Alba, E., et al. (eds.) CAEPIA 2021. LNCS (LNAI), vol. 12882, pp. 237–246. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-85713-4_23

    Chapter  Google Scholar 

  17. Schlechte, T., Borndörfer, R., Erol, B., Graffagnino, T., Swarat, E.: Micro-macro transformation of railway networks. J. Rail Transp. Plann. Manage. 1(1), 38–48 (2011). https://doi.org/10.1016/j.jrtpm.2011.09.001

    Article  MATH  Google Scholar 

  18. Schwanhäußer, W.: Die Bemessung der Pufferzeiten im Fahrplangefüge der Eisenbahn. Ph.D. thesis (1974). https://www.via.rwth-aachen.de/downloads/Dissertation_Schwanhaeusser_2te_Auflage_Text.pdf

  19. Weiß, R., Opitz, J., Nachtigall, K.: A novel approach to strategic planning of rail freight transport. In: Helber, S., et al. (eds.) Operations Research Proceedings 2012. ORP, pp. 463–468. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-00795-3_69

    Chapter  Google Scholar 

Download references

Acknowledgements

The work of Stefan Ratschan was supported by the project GA21-09458S of the Czech Science Foundation GA ČR and institutional support RVO:67985807. The work of Tomáš Kolárik was supported by CTU project SGS20/211/OHK3/3T/18.

Author information

Authors and Affiliations

  1. Faculty of Information Technology, Czech Technical University in Prague, Prague, Czechia

    Tomáš Kolárik

  2. Institute of Computer Science, The Czech Academy of Sciences, Prague, Czechia

    Stefan Ratschan

Authors
  1. Tomáš Kolárik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Ratschan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tomáš Kolárik .

Editor information

Editors and Affiliations

  1. University of Toronto, Toronto, ON, Canada

    Marsha Chechik

  2. RWTH Aachen University, Aachen, Germany

    Joost-Pieter Katoen

  3. University of Lübeck, Lübeck, Germany

    Martin Leucker

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kolárik, T., Ratschan, S. (2023). Railway Scheduling Using Boolean Satisfiability Modulo Simulations. In: Chechik, M., Katoen, JP., Leucker, M. (eds) Formal Methods. FM 2023. Lecture Notes in Computer Science, vol 14000. Springer, Cham. https://doi.org/10.1007/978-3-031-27481-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-27481-7_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-27480-0

  • Online ISBN: 978-3-031-27481-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation