Computational Technology Resources - CCC

B. Farkas¹ and T. Bartha^1,2

¹Department of Control for Transportation and Vehicle Systems, Faculty of Transportation Engineering and Vehicle Engineering, Budapest University of Technology and Economics, Hungary
²Systems and Control Laboratory, Institute for Computer Science and Control, Eötvös Loránd Research Network, Budapest, Hungary

Keywords: railway interlocking, railway topology modelling, route control table, formal methods, Petri nets, T-invariants.

Abstract

The efficiency and safety of rail transport are ensured by interlocking systems. In the areas controlled by interlocking systems, trains can only run on locked routes. Route control tables made by plan engineers include all the routes and the related safety conditions for a given station layout. The preparation process of railway interlocking plans is still mostly done manually, but it is supported by several tools. For the verification of completed plans, there is no established, systematic methodology yet. In our paper, we define the planning process steps. The first step is route identification, for which we developed a Petri net based method. The solution can be derived from the structural properties of a specially crafted Petri net, in particular its T-invariants. The station topology can be decomposed into elementary objects, each of which can be modelled by corresponding Petri net fragments. We demonstrate our method for the identification of routes in a case study. The paper describes the models of objects defined for track elements and the Petri net constructed from them. The results can be used to prepare the route control tables (conflicting routes, point positions, and occupancy detection).

download the full-text of this paper (PDF, 11 pages, 820 Kb)

go to the previous paper
go to the next paper
return to the table of contents
return to the volume description

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCC CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Conferences ISSN 2753-3239 CCC: 1 PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON RAILWAY TECHNOLOGY: RESEARCH, DEVELOPMENT AND MAINTENANCE Edited by: J. Pombo Paper 15.7 Automated Railway Interlocking Plan Verification Using Petri Nets B. Farkas¹ and T. Bartha^1,2 ¹Department of Control for Transportation and Vehicle Systems, Faculty of Transportation Engineering and Vehicle Engineering, Budapest University of Technology and Economics, Hungary ²Systems and Control Laboratory, Institute for Computer Science and Control, Eötvös Loránd Research Network, Budapest, Hungary doi:10.4203/ccc.1.15.7 Full Bibliographic Reference for this paper B. Farkas, T. Bartha, "Automated Railway Interlocking Plan Verification Using Petri Nets", in J. Pombo, (Editor), "Proceedings of the Fifth International Conference on Railway Technology: Research, Development and Maintenance", Civil-Comp Press, Edinburgh, UK, Online volume: CCC 1, Paper 15.7, 2022, doi:10.4203/ccc.1.15.7 Keywords: railway interlocking, railway topology modelling, route control table, formal methods, Petri nets, T-invariants. Abstract The efficiency and safety of rail transport are ensured by interlocking systems. In the areas controlled by interlocking systems, trains can only run on locked routes. Route control tables made by plan engineers include all the routes and the related safety conditions for a given station layout. The preparation process of railway interlocking plans is still mostly done manually, but it is supported by several tools. For the verification of completed plans, there is no established, systematic methodology yet. In our paper, we define the planning process steps. The first step is route identification, for which we developed a Petri net based method. The solution can be derived from the structural properties of a specially crafted Petri net, in particular its T-invariants. The station topology can be decomposed into elementary objects, each of which can be modelled by corresponding Petri net fragments. We demonstrate our method for the identification of routes in a case study. The paper describes the models of objects defined for track elements and the Petri net constructed from them. The results can be used to prepare the route control tables (conflicting routes, point positions, and occupancy detection). download the full-text of this paper (PDF, 11 pages, 820 Kb) go to the previous paper go to the next paper return to the table of contents return to the volume description
Back to top	©Civil-Comp Limited 2023 - terms & conditions