A Formal Approach to Road Safety Assessment Using Traffic Conflict Techniques
Bibliographic record
Abstract
Traffic conflict techniques enable a comprehensive assessment of traffic safety analysis. Formal methods allow the identification of factors that contribute to traffic safety issues and provide evidence of potential safety degradation. As such, formal methods provide a novel way to model traffic rules and verify road users' compliance. The paper proposes formalizing a traffic safety rule in differential dynamic logic and using KeYmaera theorem prover for verification. This rule considers time-to-collision (TTC), space headway (SHW), and shockwave speed (SWV). To validate the effectiveness of this rule in realistic traffic scenarios, we conducted a study using calibrated microsimulation data from the SR528 highway in Orlando, Florida. Our analysis examined the TTC, SHW, and SWV values for vehicle platoons on the highway and demonstrated how smaller TTC and SHW values indicate shockwaves and subsequent conflicts. Furthermore, we observed that shockwave speed could contribute to traffic conflicts by enabling evasive actions such as sudden braking or lane changes as the risk of collisions increases. By highlighting these findings, we aim to provide valuable insights into the real-world applicability of formal methods for traffic safety and their potential in promoting safer driving practices that can help create reliable autonomous vehicle control systems.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.000 | 0.002 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".