A Feasibility Framework for Temporal and Conditional Consistency Checking of Sequential Chain-of-Causation Annotations

Chain-of-Causation (CoC) explanations from vision-language driving models may omit when an obligation ends. We link obligations to release conditions and condition-specific evidence, distinguish confirmed contradictions from insufficient evidence, and report the first issue event. UPPAAL observers process authored symbolic frames. In 40 legacy pairs, a memoryless checker missed cross-event errors (20/40 versus 40/40). On 144 authored scenarios, a single-obligation checker matched 96/144 expected decisions; after failure analysis, the condition-linked model matched 144/144 on the same cases, tying a finite-state machine. In 81 authored boundary cases with supplied links, retaining state matched all expected decisions; resetting state judged 41 of 44 contradictions compatible. Bounded enumeration of 35,042,928 event sequences, used to reduce circularity from case selection, matched a separate formula evaluator. Four reviewers disagreed on 27 natural scenes (Fleiss’ κ = 0.027); without independent reference labels, natural accuracy is not reported. These results demonstrate feasibility on authored inputs, not vehicle safety.

Authors

Publication Details

Journal
The Transactions of The Korean Institute of Electrical Engineers
Published
2026-11-09
DOI
https://doi.org/10.5370/kiee.2026.75.11.2969
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Feasibility Framework for Temporal and Conditional Consistency Checking of Sequential Chain-of-Causation Annotations

Jin-Hyun Kim
The Transactions of The Korean Institute of Electrical Engineers
Formal Methods in Verification
article

A Feasibility Framework for Temporal and Conditional Consistency Checking of Sequential Chain-of-Causation Annotations

Jin-Hyun Kim
article en

Abstract

Chain-of-Causation (CoC) explanations from vision-language driving models may omit when an obligation ends. We link obligations to release conditions and condition-specific evidence, distinguish confirmed contradictions from insufficient evidence, and report the first issue event. UPPAAL observers process authored symbolic frames. In 40 legacy pairs, a memoryless checker missed cross-event errors (20/40 versus 40/40). On 144 authored scenarios, a single-obligation checker matched 96/144 expected decisions; after failure analysis, the condition-linked model matched 144/144 on the same cases, tying a finite-state machine. In 81 authored boundary cases with supplied links, retaining state matched all expected decisions; resetting state judged 41 of 44 contradictions compatible. Bounded enumeration of 35,042,928 event sequences, used to reduce circularity from case selection, matched a separate formula evaluator. Four reviewers disagreed on 27 natural scenes (Fleiss’ κ = 0.027); without independent reference labels, natural accuracy is not reported. These results demonstrate feasibility on authored inputs, not vehicle safety.

The Transactions of The Korean Institute of Electrical EngineersVol. 75(11)
Formal Methods in Verification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon