Applied Bounded Model Checking for Interlocking System Designs

Anne Elisabeth Haxthausen, Jan Peleska, Ralf Pinger

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

239 Downloads (Pure)


In this paper the verification and validation of interlocking systems is investigated. Reviewing both geographical and route-related interlocking, the verification objectives can be structured from a perspective of computer science into (1) verification of static semantics, and (2) verification of behavioural (operational) semantics. The former checks that the plant model – that is, the software components reflecting the physical components of the interlocking system – has been set up in an adequate way. The latter investigates trains moving through the network, with the objective to uncover potential safety violations. From a formal methods perspective, these verification objectives can be approached by theorem proving, global, or bounded model checking. This paper explains the techniques for application of bounded model checking techniques, and discusses their advantages in comparison to the alternative approaches
Original languageEnglish
Title of host publicationSoftware Engineering and Formal Methods. Revised Selected Papers
Publication date2014
ISBN (Print)978-3-319-05031-7
ISBN (Electronic)978-3-319-05032-4
Publication statusPublished - 2014
Event11th International Conference on Software Engineering and Formal Methods (SEFM) 2013 - Madrid, Spain
Duration: 25 Sep 201327 Sep 2013


Conference11th International Conference on Software Engineering and Formal Methods (SEFM) 2013
OtherCollocated Workshops: BEAT2, WS-FMDS, FM-RAIL-Bok, MoKMaSD, and OpenCert, September 23-24, 2013
Internet address
SeriesLecture Notes in Computer Science

Fingerprint Dive into the research topics of 'Applied Bounded Model Checking for Interlocking System Designs'. Together they form a unique fingerprint.

Cite this