Research
Formal Safety Guarantees for Autonomous Vehicles using Barrier Certificates
Overview Research area: Formal verification for autonomous driving — specifically the combination of Barrier Certificates (BCs), the Time-to-Collision (TTC) traffic metric, and Satisfiability Modulo T
- arXiv
- 2601.09740
- Published
- 2026-01-08
- Authors
- Oumaima Barhoumi, Mohamed H Zaki, Sofiène Tahar
AI summary
Overview
Research area: Formal verification for autonomous driving — specifically the combination of Barrier Certificates (BCs), the Time-to-Collision (TTC) traffic metric, and Satisfiability Modulo Theories (SMT) solving, applied to car-following on highways.
Technical level: Advanced. The paper assumes familiarity with control-theoretic safety certificates, SMT solvers, and traffic-conflict metrics, though its core idea (keep a provable safety margin between cars) is accessible.
Scope: The paper develops a formally verified framework for Connected and Autonomous Vehicles (CAVs) in which a TTC-based barrier certificate is checked with the Z3 SMT solver and used to trigger speed adjustments, validated on the real-world HighD highway dataset.
What This Paper Is About
Autonomous vehicles rely on data-driven AI components that behave as black boxes, with no mathematical guarantee that they will stay safe in dynamic, mixed traffic alongside unpredictable human drivers. The authors address rear-end, car-following risk by expressing the safety requirement as a Time-to-Collision (TTC)-based Barrier Certificate and then proving, with a formal solver, that a vehicle starting in the safe region cannot transition into the unsafe region. When the certificate is violated in real traffic data, a dynamic speed adjustment is applied to push the vehicle back into the verified safe region.
Key Contributions
- A TTC-based Barrier Certificate (TTC-BC) formulation that partitions the state space of relative distance and relative velocity between a following vehicle and its leader into safe and unsafe regions, with the boundary set by a TTC safety threshold.
- A formal verification procedure using the Z3 SMT solver that encodes the BC properties as logical constraints and searches for counterexamples — a specific instance where a safe state transitions to an unsafe one — rather than assuming certificate validity through construction.
- An adaptive speed-adjustment mechanism that acts on vehicle pairs violating the barrier condition, recalculating TTC after the adjustment so that safety margins are recovered.
- Empirical validation on the HighD dataset of naturalistic German highway trajectories, moving beyond theoretical proof and simulation to quantify conflict reduction in real car-following scenarios.
Main Findings
- Conflict reduction of up to 40%: Applying BC-based regulation reduced the number of potential conflicts — defined as instances with TTC below 3 seconds — by up to 40% across multiple traffic segments.
- Complete elimination in some lanes: In certain lanes, unsafe interactions were entirely eliminated after the speed adjustment.
- Speed adjustment increases TTC: Recalculated TTC values consistently increased after the adjustment, confirming recovery of the safety margin; braking increases the gap to the lead vehicle and therefore the temporal buffer.
- Formal verification outcomes are informative: The Z3 solver can report a counterexample (system unsafe), prove safety, or report constraints as partially satisfiable — meaning safety holds only under a subset of conditions — which guides refinement of constraint definitions and boundary conditions. If no feasible solution exists after refinement, the constraint is formally unsatisfiable, indicating the safety property cannot be guaranteed under the given assumptions.
- Frame counts reported: Comparison figures for before-versus-after speed adjustment are shown for 300 frames and 3000 frames respectively.
- Verification assumptions encoded: Physical constraints of positive position and velocity, acceleration bounded in the interval [-6, 3], an ordering constraint (following vehicle behind and faster than the leader), and a collision-avoidance constraint on gap minus vehicle length.
Methodology in Plain English
The researchers treat a highway car-following situation as a mathematical relationship between the distance gap and the speed difference between two vehicles. They define a safety margin using Time-to-Collision: if the time before a collision would occur is below a chosen threshold, the situation counts as unsafe. This margin is written as a barrier certificate — a function whose sign tells you whether you are on the safe or unsafe side of the boundary.
Because a barrier certificate is only as trustworthy as its construction, they hand it to a formal reasoning tool, the Z3 SMT solver, along with the physical rules of the scenario (positive speeds and positions, acceleration limits, the following vehicle being behind but faster than its leader, and a hard no-collision condition). The solver then hunts for a counterexample: a state that is currently safe but whose rate of change would carry it into an unsafe state. If the solver finds none, safety is proven rather than assumed; if the constraints come back only partially satisfiable, the researchers tighten the definitions.
Finally, they run the verified certificate over real recorded highway trajectories from the German Autobahn (the HighD dataset). Vehicle pairs whose TTC falls below the threshold get a speed reduction, which widens the gap and raises the TTC. They then recount conflicts, comparing the number of TTC-below-3-seconds events before and after regulation.
Why This Matters
Impact on research. The paper targets a known weakness in safety-certificate research: prior work using Control Barrier Functions with temporal-logic specifications often assumes certificates are valid because of how they were constructed, with no independent soundness check. Here the certificate is checked by an SMT solver, and the results (proven, counterexample, partially satisfiable, unsatisfiable) feed back into refining the constraints. The work also connects symbolic formal methods to a metric — TTC — that traffic engineers already use and interpret.
Real-world applications.
- Advanced driver-assistance and automatic emergency braking systems that need a defensible, provable braking rule rather than a tuned heuristic.
- Adaptive cruise control and platooning of connected vehicles, where safe following distance must be enforced continuously in mixed traffic.
- Safety certification and regulatory approval of autonomous driving stacks, where the requirement is evidence that unsafe states are unreachable, not just a low crash rate in testing.
- Fleet-level traffic management on highways, since the framework operates on per-lane conflicts and reports lane-level improvements.
Industry relevance. Traditional validation by testing and simulation can only sample a subset of possible scenarios in a high-dimensional continuous environment. A solver-checked safety invariant offers a complementary form of evidence that is interpretable (TTC thresholds) and machine-checkable (formal proof), which is attractive for automotive safety cases and for certifying learning-enabled controllers.
Future Directions
- Extending beyond longitudinal car following. The paper explicitly investigates car-following and rear-end interactions with TTC as a longitudinal safety indicator; lateral maneuvers such as lane changes and more complex multi-vehicle scenarios are not covered and remain open.
- Applying formal verification to existing synthesized certificates. The authors argue that barrier certificates in prior multi-agent and Signal Temporal Logic work may lack soundness guarantees; verifying those certificates rather than newly defined ones is a natural next step.
- Closing the partially-satisfiable and unsatisfiable gaps. Cases where safety holds only under a subset of conditions, or cannot be guaranteed at all under the stated assumptions, point to further refinement of constraint definitions and boundary conditions.
- Deployment on physical vehicles. The evaluation is on recorded highway data and offline speed adjustment; how the verified certificate and adaptive control perform in closed-loop, on-road or hardware-in-the-loop operation is not reported.
Target Audience
Researchers and graduate students in formal methods, control theory, and autonomous driving safety; automotive engineers and safety-case practitioners who need certifiable rather than merely empirical evidence; and traffic-safety analysts interested in formalizing familiar conflict metrics such as Time-to-Collision. Readers without a background in SMT solving or barrier certificates will need to work through the formal machinery, as the paper does not present it at an introductory level.
Authors’ abstract
Modern AI technologies enable autonomous vehicles to perceive complex scenes, predict human behavior, and make real-time driving decisions. However, these data-driven components often operate as black boxes, lacking interpretability and rigorous safety guarantees. Autonomous vehicles operate in dynamic, mixed-traffic environments where interactions with human-driven vehicles introduce uncertainty and safety challenges. This work develops a formally verified safety framework for Connected and Autonomous Vehicles (CAVs) that integrates Barrier Certificates (BCs) with interpretable traffic conflict metrics, specifically Time-to-Collision (TTC) as a spatio-temporal safety metric. Safety conditions are verified using Satisfiability Modulo Theories (SMT) solvers, and an adaptive control mechanism ensures vehicles comply with these constraints in real time. Evaluation on real-world highway datasets shows a significant reduction in unsafe interactions, with up to 40\% fewer events where TTC falls below a 3 seconds threshold, and complete elimination of conflicts in some lanes. This approach provides both interpretable and provable safety guarantees, demonstrating a practical and scalable strategy for safe autonomous driving.