Book Sections Year : 2026

Application of Model-Checking Techniques to Railway Scheduling Problems

Abstract

Railway scheduling problems can be formulated as instances of the NP-hard job-shop scheduling problem. In this paper, written in the honour of Alessandro Fantechi, we experiment with various encodings of the job-shop scheduling problem in LNT, a modern formal modelling language with a process calculus flavour. We also report on the computation of solutions with various model checking tools of the CADP toolbox.

Fichier principal
Vignette du fichier
paper.pdf (419.31 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Licence

Dates and versions

hal-05497416 , version 1 (06-02-2026)

Licence

Identifiers

Cite

Radu Mateescu, Wendelin Serwe, Aline Uwimbabazi. Application of Model-Checking Techniques to Railway Scheduling Problems. Journeys Between Formal Methods and the Railway Industry, 16470, Springer Nature Switzerland, pp.216-235, 2026, Lecture Notes in Computer Science, ⟨10.1007/978-3-032-12484-5_12⟩. ⟨hal-05497416⟩
174 View
45 Download

Altmetric

Share

  • More