2014
DOI: 10.1007/978-3-319-05032-4_16
|View full text |Cite
|
Sign up to set email alerts
|

Applied Bounded Model Checking for Interlocking System Designs

Abstract: Abstract. 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 wa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
26
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
2

Relationship

3
5

Authors

Journals

citations
Cited by 28 publications
(27 citation statements)
references
References 19 publications
1
26
0
Order By: Relevance
“…The cases in Table 2 are listed in the approximate order of increasing network complexity. The first seven cases are made-up networks inspired by the typical examples used in other studies about formal verification of railway interlocking systems [20,38,25,24]. For instance, the example network shown in Figure 1 is case Mini in Table 2.…”
Section: Experiments With Our Toolchainmentioning
confidence: 99%
See 2 more Smart Citations
“…The cases in Table 2 are listed in the approximate order of increasing network complexity. The first seven cases are made-up networks inspired by the typical examples used in other studies about formal verification of railway interlocking systems [20,38,25,24]. For instance, the example network shown in Figure 1 is case Mini in Table 2.…”
Section: Experiments With Our Toolchainmentioning
confidence: 99%
“…SAT-based model checking and slicing technique are used in [26]. In order to remedy the problem with state space explosion in the global model checking approach, we have recently used BMC for the work described here and for some other applications [23,24]. In the current work, a combination of SMT-based BMC with inductive reasoning allowed us to verify safety properties without having to explore the whole state space, hence we were able to push the bounds even further to handle larger networks of industrial size.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The research shows that interlocking systems of realistic size are currently out of reach for both flavors of general purpose model checkers. To mitigate the state-space explosion problem, [21] uses bounded model checking [8] for interlockings. Instead of attempting an exhaustive coverage of the state-space, symbolically or explicitly, bounded model checking analyses (the behavior of) a given system only up to a given bound (which is raised incrementally in case analyzing a problem instance is inconclusive).…”
Section: Related Workmentioning
confidence: 99%
“…For example, abstraction techniques can be applied at the domain modelling level before the model checking is performed [9]. Other very efficient techniques applied for real world railways are bounded model checking [8] and k-induction [19]. The state explosion problem can also be tamed using techniques that allow a compositional approach to the model checking task [10]: the model checker must prove that assumptions imply the guarantees of each 1 For instance the July 2016 rural Southern-Italy head-on train collision would have been prevented if automated train detection equipment had been in place.…”
Section: Introductionmentioning
confidence: 99%