On the Verification of Cooperating Traffic Agents

Adaptive Cruise Control: Hybrid, Distributed, and Now Formally Verified

“…Damm et al [2] give a verification rule that is specialized to collision freedom of traffic agents. To show that two cars do not collide, they need to manually prove eighteen verification conditions.…”

“…This does not prove the absence of small relative velocity collisions, nor the behavior of 3 platoons or when not merging. In contrast to the manual semantic reasoning of [2,20,21], our techniques follow a formal proof calculus [19], which can be mechanized. In the case studies analyzed by [20,21] safety is proved only for a particular scenario, while our modular formal proofs deal with the general case.…”

“…Unlike [2,12,14,17], we prove safety for an arbitrary number of cars. Our techniques and results are more general than the case-specific approaches [2,12,14,17,20,21], as we prove collision-freedom for any number of cars driving on any finite number of lanes.…”

“…Because of its societal relevance, numerous parts of car control have been studied before [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18]. Major initiatives have been devoted to developing next generation individual ground transportation solutions, including the California PATH project, the SAFESPOT and PReVENT initiatives, the CICAS-V system, and many others.…”

Logical Verification and Systematic Parametric Analysis in Train Control

“…Most hybrid systems contain substantial degrees of freedom including how specific parameters are instantiated or adjusted [3,2,5]. Yet, virtually any hybrid system is only safe under certain constraints on these parameters.…”