Haxthausen, Anne Elisabeth1; Peleska, Jan3; Pinger, Ralf5
Stefan Gruner, Anne E. Haxthausen, Tom Maibaum, Markus Roggenbach
1 Department of Applied Mathematics and Computer Science, Technical University of Denmark2 Software Engineering, Department of Applied Mathematics and Computer Science, Technical University of Denmark3 Universität Bremen4 Siemens5 Siemens
In this article 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 article explains the techniques for application of bounded model checking techniques, and discusses their advantages in comparison to the alternative approaches.
Towards a Formal Methods Body of Knowledge for Railway Control and Safety Systems: Fm-rail-bok Workshop 2013, 2013, p. 21-26
Main Research Area:
Workshop on a Formal Methods Body of Knowledge for Railway Control and Safety Systems (FM-RAIL-BOK WORKSHOP 2013)Conference on Software Engineering and Formal Methods