A Formally Verified Leader Election Algorithm for Autonomous Driving Systems

As autonomous driving systems mature, the importance of fault tolerance to provide safe operation even in hazardous conditions becomes a key issue in deployment. In an autonomous driving system composed of redundant devices, it is necessary to maintain consistency across the system regarding which devices should currently be handling processing. In this paper, we present a new leader election algorithm for autonomous driving systems that guarantees consistency in the presence of the failure of any single system component. To make the algorithm practical for autonomous driving systems, we design it to both handle network link failures and guarantee liveness in the presence of a single failure. Due to the safety-critical nature of our environment and the known difficulty of testing distributed algorithms, we use formal verification to validate our proposed algorithm. Our experiments show that the algorithm completes with reasonable time in a simulated environment of an autonomous driving system.

Authors

Publication Details

Published
2024-08-21
DOI
https://doi.org/10.1109/rtcsa62462.2024.00019
Citations
1
Primary Topic
Transportation and Mobility Innovations
Type
article
Field-Weighted Citation Impact
0.20
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Formally Verified Leader Election Algorithm for Autonomous Driving Systems

Yuuki Takano, Ryuta Kambe, Benjamin Gilby
1 citations
Transportation and Mobility Innovations
0.20
article

A Formally Verified Leader Election Algorithm for Autonomous Driving Systems

Yuuki Takano, Ryuta Kambe, Benjamin Gilby
article en
1 citations

Abstract

As autonomous driving systems mature, the importance of fault tolerance to provide safe operation even in hazardous conditions becomes a key issue in deployment. In an autonomous driving system composed of redundant devices, it is necessary to maintain consistency across the system regarding which devices should currently be handling processing. In this paper, we present a new leader election algorithm for autonomous driving systems that guarantees consistency in the presence of the failure of any single system component. To make the algorithm practical for autonomous driving systems, we design it to both handle network link failures and guarantee liveness in the presence of a single failure. Due to the safety-critical nature of our environment and the known difficulty of testing distributed algorithms, we use formal verification to validate our proposed algorithm. Our experiments show that the algorithm completes with reasonable time in a simulated environment of an autonomous driving system.

Openalex Percentile: Top 50%
Transportation and Mobility Innovations
0.20
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.