2012
DOI: 10.1007/978-3-642-34032-1_26
|View full text |Cite
|
Sign up to set email alerts
|

Distributing the Challenge of Model Checking Interlocking Control Tables

Abstract: Abstract. Railway interlocking systems represent a challenge for model checkers: although encoding interlocking rules as finite state machines can be quite straightforward, and safety properties to be proved are easily expressible, the inherent complexity related to the high number of variables involved makes the verification of such systems typically incur state space explosion problems.Domain-specific techniques have been adopted to advance the size of interlocking systems that can be successfully proved, bu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
2
1

Relationship

2
6

Authors

Journals

citations
Cited by 18 publications
(8 citation statements)
references
References 10 publications
0
8
0
Order By: Relevance
“…In [25] Winter pushes the applicability bounds of symbolic model checking (NUSMV) by optimizing the ordering strategies for variables and transitions using domain knowledge about the track layout. Fantechi suggests in [10] to exploit a distributed modelling of geographical interlocking systems and break the verification task into smaller tasks that can be distributed to multiple processors such that they can be verified in parallel. In [20], it is suggested to reduce the state space using abstraction techniques reducing the number of track sections and the number of trains.…”
Section: Related Workmentioning
confidence: 99%
“…In [25] Winter pushes the applicability bounds of symbolic model checking (NUSMV) by optimizing the ordering strategies for variables and transitions using domain knowledge about the track layout. Fantechi suggests in [10] to exploit a distributed modelling of geographical interlocking systems and break the verification task into smaller tasks that can be distributed to multiple processors such that they can be verified in parallel. In [20], it is suggested to reduce the state space using abstraction techniques reducing the number of track sections and the number of trains.…”
Section: Related Workmentioning
confidence: 99%
“…The contributions to this special issue are further elaborations of the ones presented at the conference track [15][16][17][18][19][20][21] and they focus on the application of formal reasoning to the development of safety-critical, computer-based railway signalling systems. Indeed, these contributions are representative of two challenging industrial research directions in the domain of railway signalling software development.…”
Section: Formal Methods: From the Conference Session On Intelligent Tmentioning
confidence: 99%
“…Formula (2) states that if there is a train on Track T_01BC, the direction on Point P_02AC cannot change at the next state. Formula (3) states that if there is a train moving from Track T_092 to Track T_01BC, Point P_01BC must be set and stay to left. Such equations are related to the safety, the next ones ensure the availability of the system.…”
Section: Definition Of Propertiesmentioning
confidence: 99%
“…Until now, most of the research targeting the verification of the application data is based on model checking ( [2], [3], [4]) even if other approaches based on formal methods exist [5]. First, the signalling principles and the application data are translated into a model.…”
Section: Introductionmentioning
confidence: 99%