Defining and Model Checking Abstractions of Complex Railway Models Using CSP||B

The safety analysis of interlocking railway systems involves verifying collision and derailment freedom. In this paper we propose a structured way of refining track plans, in order to expand track segments so that they form collections of track segments. We show how the abstract model can be model checked to ensure the safety properties, which must also hold in the corresponding concrete track plan, so that we will never need to model check the concrete track plan directly. We also identify the minimal number of trains that needs to be considered as part of the model checking, and we demonstrate the practicality of the approach on various scenarios.

[1]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[2]  Alessio Ferrari,et al.  Model Checking Interlocking Control Tables , 2010, FORMS/FORMAT.

[3]  Jean-Raymond Abrial,et al.  The B-book - assigning programs to meanings , 1996 .

[4]  Faron Moller,et al.  Railway modelling in CSP||B: the double junction case study , 2012, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[5]  Faron Moller,et al.  Safety and Line Capacity in Railways - An Approach in Timed CSP , 2012, IFM.

[6]  Dines Bjørner TRain: The Railway domain - A "Grand Challenge" for Computing Science & Transportation Engineering , 2004, IFIP Congress Topical Sessions.

[7]  Myla Archer,et al.  Using Abstraction and Model Checking to Detect Safety Violations in Requirements Specifications , 1998, IEEE Trans. Software Eng..

[8]  William T. Ziemba,et al.  Applications and case studies , 2007 .

[9]  Anne Elisabeth Haxthausen Automated Generation of Safety Requirements from Railway Interlocking Tables , 2012, ISoLA.

[10]  Marco Roveri,et al.  Formal Verification and Validation of ERTMS Industrial Railway Train Spacing System , 2012, CAV.

[11]  Raymond Lister,et al.  Grand challenges , 2005, SGCS.

[12]  Tiziana Margaria,et al.  Leveraging Applications of Formal Methods, Verification and Validation. Applications and Case Studies , 2012, Lecture Notes in Computer Science.

[13]  Carroll Morgan,et al.  Of wp and CSP , 1990 .

[14]  Neil J. Robinson,et al.  Modelling Large Railway Interlockings and Model Checking Small Ones , 2003, ACSC.

[15]  Markus Roggenbach,et al.  Combining event-based and state-based modelling for railway verification , 2012 .

[16]  J. Davenport Editor , 1960 .

[17]  Steve A. Schneider,et al.  CSP theorems for communicating B machines , 2005, Formal Aspects of Computing.

[18]  W. H. J. Feijen,et al.  Beauty Is Our Business: A Birthday Salute to Edsger W.Dijkstra , 1990 .

[19]  Kirsten Winter,et al.  Optimising Ordering Strategies for Symbolic Model Checking of Railway Interlockings , 2012, ISoLA.