Open Access iconOpen Access

ARTICLE

Deterministic Workflow Auditing via Dependency–State Coupled Verification and Explainable Conflict Tracing

Jixin Xu, Xingxin Li*, Senlin Zhu, Qingqing Song

Shijiazhuang Campus, Army Engineering University of PLA, Shijiazhuang, China

* Corresponding Author: Xingxin Li. Email: email

Computers, Materials & Continua 2026, 89(1), 25 https://doi.org/10.32604/cmc.2026.083290

Abstract

Complex procedural workflows in maintenance and parametric design often fail due to violated long-range dependencies, unsatisfied preconditions, and inconsistent parameter bindings. In such workflows, an early structural deviation may propagate silently and eventually induce global failure. Existing workflow auditing methods, particularly those based on large language models (LLMs) or sequence matching, often rely on implicit reasoning, exhibit unstable outputs, and provide limited support for reproducible error localization. To address these limitations, we propose a verification-centric auditing framework that couples an explicit typed dependency graph with an executable state transition system. The dependency graph represents data dependencies, precondition dependencies, parameter couplings, and mutex/resource conflicts among workflow steps, while the transition system provides deterministic execution semantics for formal consistency checking. Given a structured audit instance parsed from raw or multimodal evidence, the framework verifies formal consistency through forward execution with incremental satisfiability checking over stepwise constraint stores. When an inconsistency is detected, the framework produces compact and reproducible explanations by combining provenance-guided dependency slicing, UNSAT core or near-minimal conflict-core extraction, and type-prioritized propagation-path tracing. This process identifies both conflict sources and their long-range effects. We evaluate the proposed method on two benchmarks, MyFixit-Audit (text and image, 25,000 samples) and Fusion360-Audit (text, image, and structure, 12,000 samples), covering binary consistency auditing, inconsistency typing, error localization, and structural trace recovery. Experimental results show that the proposed verifier outperforms multimodal fusion and LLM-based baselines, achieving accuracy values of 0.953 on MyFixit-Audit and 0.951 on Fusion360-Audit. In addition, it provides fully deterministic decisions, interpretable explanations, and efficient execution for reliable workflow auditing, with a median runtime of 123 ms per sample.

Keywords

Workflow auditing; formal consistency checking; dependency graph; constraint solving; explainable AI; multimodal understanding

Cite This Article

APA Style
Xu, J., Li, X., Zhu, S., Song, Q. (2026). Deterministic Workflow Auditing via Dependency–State Coupled Verification and Explainable Conflict Tracing. Computers, Materials & Continua, 89(1), 25. https://doi.org/10.32604/cmc.2026.083290
Vancouver Style
Xu J, Li X, Zhu S, Song Q. Deterministic Workflow Auditing via Dependency–State Coupled Verification and Explainable Conflict Tracing. Comput Mater Contin. 2026;89(1):25. https://doi.org/10.32604/cmc.2026.083290
IEEE Style
J. Xu, X. Li, S. Zhu, and Q. Song, “Deterministic Workflow Auditing via Dependency–State Coupled Verification and Explainable Conflict Tracing,” Comput. Mater. Contin., vol. 89, no. 1, pp. 25, 2026. https://doi.org/10.32604/cmc.2026.083290



cc Copyright © 2026 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 258

    View

  • 64

    Download

  • 0

    Like

Share Link