Papers › Formalizing Traffic Rules for Machine Interpretability
Formalizing Traffic Rules for Machine Interpretability
Klemens Esterle, Luis Gressenbuch, Alois Knoll
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Autonomous vehicles need to be designed to abide by the same rules that humans follow. This is challenging, because traffic rules are fuzzy and not well defined, making them incomprehensible to machines. Satisfaction cannot be incorporated in a planning component without proper formalization, nor can it be monitored and verified during simulation or testing. However, no research work has provided a consistent set of machine-interpretable traffic rules for a given operational driving domain. In this paper, we propose a methodology for the legal study and formalization of traffic rules in a formal language. We use Linear Temporal Logic as a formal specification language to describe temporal behaviors, capable of capturing a wide range of traffic rules. We contribute a formalized set of traffic rules for dual carriageways and evaluate the effectiveness of our formalized rules on a public dataset.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections