Conference paper · Book chapter
Applied Bounded Model Checking for Interlocking System Designs
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
Language: | English |
---|---|
Publisher: | Springer |
Year: | 2014 |
Pages: | 205-220 |
Proceedings: | 11th International Conference on Software Engineering and Formal Methods (SEFM) 2013International Conference on Software Engineering and Formal Methods |
Series: | Lecture Notes in Computer Science |
ISBN: | 3319050311 , 331905032X , 331905032x , 9783319050317 and 9783319050324 |
ISSN: | 03029743 and 16113349 |
Types: | Conference paper and Book chapter |
DOI: | 10.1007/978-3-319-05032-4_16 |
ORCIDs: | Haxthausen, Anne Elisabeth |