A Place-Timed Petri Net-Based Method to Avoid Deadlock and Conflict in Railway Networks

The real-time traffic control of railway networks imposes safety constraints and authorizes movements of trains. This work deals with it by focusing on conflict and deadlock avoidance problems. A place-timed Petri net model is developed for a railway network. Based on it, a conflict avoidance method...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on intelligent transportation systems 2022-08, Vol.23 (8), p.10763-10772
Main Authors: Luo, Jianchao, Zhou, Mengchu, Wang, Jun-Qiang
Format: Article
Language:English
Subjects:
Algorithms
Avoidance
conflict avoidance
deadlock avoidance
discrete event system
Layout
Petri net (PN)
Petri nets
Polynomials
Rail transportation
Railway network
Railway stations
Railways
Safety
Schedules
Sensors
System recovery
Traffic conflicts
Train traffic control
Trains
Transportation networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The real-time traffic control of railway networks imposes safety constraints and authorizes movements of trains. This work deals with it by focusing on conflict and deadlock avoidance problems. A place-timed Petri net model is developed for a railway network. Based on it, a conflict avoidance method is presented to ensure that safety principles in railway networks are respected. Also, a polynomial deadlock avoidance policy based on the Banker's algorithm is proposed. It authorizes the movement of trains between block sections and stations. The proposed conflict avoidance method and deadlock avoidance policy together ensure a railway network to be conflict-free and deadlock-free. Experimental results show that they are effective and efficient.
ISSN:1524-9050
1558-0016
DOI:10.1109/TITS.2021.3095661