LAST-V2X: Language-Driven Adaptive Scenario Synthesis and Testing for Communication-Induced Failures in V2X Safety Applications
Organizations: Texas A&M University · University of Wisconsin-Madison · University of Wyoming
Abstract
Vehicle-to-everything (V2X) communication enables connected vehicles to make safety-critical decisions, but delayed, missing, or incorrect information can compromise driving safety. Systematically testing such failures is challenging because traffic interactions, communication conditions, and application responses must be jointly configured to produce meaningful scenarios. This paper presents LAST-V2X, a language-driven, adaptive framework for automated scenario synthesis and safety testing of V2X applications. LAST-V2X leverages large language models (LLMs) to translate natural-language test descriptions into executable scenarios grounded in roadway geometry, V2X communication semantics, and vehicle behavior. The framework integrates physical traffic simulation with spatially aware communication modeling and message-level fault injection to evaluate how information degradation affects vehicle decisions. To establish whether an observed safety failure is caused by communication rather than the underlying traffic conditions, LAST-V2X employs matched executions under degraded and ground-truth information. Furthermore, an execution-guided refinement mechanism combines parameter search and LLM self-reflection to identify ineffective test configurations, improve scenario effectiveness, and produce minimal reproducible failure cases. Experiments across diverse CARLA environments and V2X safety applications demonstrate the framework's ability to generate reliable scenarios, distinguish communication-induced failures from unrelated safety violations, and substantially improve failure discovery through adaptive refinement. These results establish LAST-V2X as a systematic approach to language-driven, causally verified, and adaptive safety testing for connected vehicle systems.
Figures & tables
| Age budget (s) | Position | ||||
| Application | Full name | Function | SPaT | BSM | error (m) |
| Signal applications infrastructure-to-vehicle (SPaT/MAP) | |||||
| RLVW | Red-Light Violation Warning | Warns against entering on red | 1.0 | – | – |
| GLOSA | Green Light Optimal Speed Advisory | Recommends speed for a green arrival | 1.0 | – | – |
| Conflict applications vehicle-to-vehicle (BSM) | |||||
| IMA | Intersection Movement Assist | Warns of crossing-vehicle conflicts | – | 0.5 | 1.5 |
| Component and metric | With | Without | Component and metric | With | Without | ||
| Ground-truth rollout | Height-aware blockage | ||||||
| Alarms raised (112 live scenes) | 1 | 60 | Divergences (15 healthy scenes) | 34 | 60 | ||
| False alarms among them | 0 | 59 | In-range coverage, Town10 (%) | 100.0 | 47.7 | ||
| Feasibility gate | Scene planner (multi-approach junctions) | ||||||
| IMA admissions per 150 executions | 29.0 | 15.3 | Conflict gap, ground-truth ego (m) | 10.8 | 49.8 | ||
| Seeds with zero admissions (of 3) | 0 | 1 | Conflict gap, message-driven ego (m) | 2.4 | 5.7 | ||
Appendix figures & tables7 assets
Supplementary material from the paper’s appendix.
Appendix
| Check | Condition rejected or flagged |
| error blocking; returned to the parser for repair | |
| no_effective_fault | No fault can breach any application budget (a vacuous intent); suggestions name or a freeze/skew fault |
| anchor_beyond_horizon | The -th anchored occurrence, or the ego decision point, falls after the horizon |
| agent_unreachable | The conflict cannot form |
| no_locus | Retrieval returns no locus; the message names the first filter that empties the candidate set |
| warn executed, but flagged as unlikely to be attributable | |
| Parameter | Symbol | Value | Parameter | Symbol | Value |
| Path loss | Height-aware blockage | ||||
| Transmit power | 0 dBm | Building loss rate | 5 dB/m | ||
| Path-loss exponent | 2.0 | Ray sampling step | 1 m | ||
| Noise floor | dBm | RSU antenna height | 6.5 m | ||
| Communication radius | 100 m † | Receiver antenna height | 1.5 m | ||
| Latency and delivery | Saturation excess height | 10 m | |||
| Operator | Target | Effect | Search range |
| Delivery faults | |||
| drop | any | Suppresses the next broadcasts in the window (all if is unset) | |
| burst_drop | any | Gilbert–Elliott burst loss with transitions and a bad-state loss rate | pathology library |
| delay | any | Constant delay plus jitter, optionally applied after reception (decode delay) | s |
| Timestamp fault | |||
| skew | any | Shifts the reported timestamp without delaying delivery, so the receiver misreads the age | s |
| App. | Decision rule | Violation |
| Signal applications | ||
| RLVW | Predicts the phase at arrival; once , stops if arrival falls on red, or on yellow after the countdown expires. Holds on a current red within 6 m of the bar; without signal data, stops at the decision point | Red entry |
| GLOSA | Keeps speed if arriving within the current green; otherwise advises , clipped to m/s | Red entry |
| Conflict applications | ||
| IMA | Stops if a crossing track reaches the conflict point within 3.5 s of the ego (ego arrival within 12 s) | Collision, m |
| LTA | Stops if an opposing track arrives before the ego’s arrival plus a 4.0 s gap (12 s horizon) | Collision, m |
| Operator | Change |
| Fault vector | |
| Fault magnitude | Scales a delay or skew by or ; changes a drop count by to ; scales or shifts |
| Fault window | Shifts the offset by s, resets the duration, or changes the anchor event |
| Stuck feed ∗ | SPaT phase and countdown freeze opening 2.5 or 5 s before the amber onset |
| Outage ∗ | Window-long drop of the consumed stream (5, 8, or 12 s) |
| Track freeze ∗ | Freezes neighbors’ BSM kinematics from 3–8 s before the ego’s decision point |
| Experiment | Scale | Seeds |
| Normal-traffic benchmark | 100 prompts, 8 towns | 1 per scene |
| Communication-fault suite | 12 prompts | 1 per scene |
| Corridor traversal | 6 prompts, Town05; 3 offset plans 3 radio ranges | 10 (420 runs) |
| Multiple connected vehicles | 6 prompts, Town05 | 10 per condition |
| Refinement suite ‡ | 50 prompts; 120 search candidates and 5 reflection rounds per scene | 1 per scene |