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.
Domains
| Origin | Files produced by the author(s) |
|---|---|
| Licence |