Scholarlink

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.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Application of Model-Checking Techniques to Railway Scheduling Problems

  • 章节

  • 发表日期：

    2026年

查看全文
  • Radu Mateescu,
  • Wendelin Serwe,
  • Aline Uwimbabazi

摘要

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.