This paper is a practitioner guide to graph-based workflow pathways for long-running, stateful, multi-step generative AI systems in business processes and presents three executable recipes to show how typed state, conditional routing, deterministic tools, retries, interrupts, checkpoints, and traces fit together.
Abstract
This paper is a practitioner guide to graph-based workflow pathways for long-running, stateful, multi-step generative AI systems in business processes. Rather than treating LangGraph, a low-level orchestration framework for stateful agents, as a model-quality benchmark target, we present three executable recipes -- SQL analytics with repair loops, agentic retrieval-augmented generation with evidence gating, and human-in-the-loop policy review with interrupt and checkpoint recovery -- to show how typed state, conditional routing, deterministic tools, retries, interrupts, checkpoints, and traces fit together. LangGraph is positioned by workflow-complexity fit, not as a universal default: simpler ReAct-style or plain SDK loops may be better for basic tool use, schema-first tools for structured extraction and validation, and DSPy when prompt or program optimization is the main goal. Each recipe explains when LangGraph is worth the extra structure and which implementation patterns make routes, pauses, and audit trails explicit product behavior rather than hidden prompt logic.
TGMS is a bi-temporal property graph management system that exposes thirteen verified temporal operators as agent tools that can answer belief-state questions such as ``as of transaction time $T$, what did the system believe?''
Large Language Models (LLMs) have accelerated the adoption of software development agents, now widely available as Integrated Development Environment (IDE) extensions and standalone applications. While these agents are typically general-purpose, it remains unclear whether specialist agents justify their additional development effort. We investigate this question in the context of business process automation, focusing on the transformation of Business Process Model and Notation (BPMN) diagrams into executable agentic workflows. Since BPMN specifies explicit control-flow semantics, we focus on deterministic workflows in which a fixed process model and inputs uniquely determine the executed path. We introduce a specialist workflow for this task and compare it against generalist agents such as Roo and Cline. Our results show that the specialist solution produces agents that outperform generalist baselines by approximately 9-20 percentage points in tool-use exactness, 2-4x in penalty-adjusted latency, and 3x fewer tool-call errors, while reducing generation token cost by over 95% and eliminating repair iterations. We also find that generalist agents generate code inconsistently in both functionality and quality, limiting their suitability for industrial settings where reliability and maintainability are essential.
Harris Borman, Herman Wandabwa, Fusun Yu et al.· 0 citations
This work presents StructureClaw, an artifact-centered workbench in which LLM agents operate through governed engineering skills, typed tools, shared artifact state, and local analysis backends, together with StructureClaw-Bench, an executable benchmark of 150 controlled scenarios spanning standard workflows, interactive robustness, and multimodal structural-model reconstruction.
COVENANT is proposed, a compiler-and-interpreter architecture for workflow-aligned agent execution that substantially mitigates workflow misalignment, moving LLM-agent alignment beyond isolated prompt following toward reliable execution of complex and multi-step workflows.
Policy-governed agents must interpret case evidence while reliably following authorized procedures. We present STAGE, an executable-graph framework that confines model judgment to policy-scoped nodes while placing procedural control in deterministic code. We evaluate STAGE on three public policy-following benchmarks and Smart Dispute, a proprietary banking benchmark. Compared with monolithic full-policy execution, STAGE improves task success and repeated-run reliability, with its largest observed gains on the deeper workflows. On $\tau^2$-bench Telecom and Smart Dispute, $\mathrm{Pass}^{3}$ improves by up to 55.0 and 65.7 percentage points, respectively. These results demonstrate the value of combining localized policy reasoning with deterministic procedural control for enterprise use.
Mengxi Luo, Changjiao Chen, An Cao et al.· 0 citations
Large language model (LLM) agents still tend to run long-horizon workflows as a single linear transcript. This representation is straightforward to implement, but it becomes brittle once a task spans many turns, tool outputs, updates, and late-binding pivots. We examine context management for an instrumented, single-session, long-horizon, multi-turn agentic workflow in which dependency links are available from workflow metadata, tool logs, citations, or controller annotations, and introduce Graph-of-Context (GoC) as a split between a recoverable storage graph and a budget-constrained active context. GoC is built around three recoverable operators: fold, which compresses inactive episodes into proxy nodes in the active view while preserving the original subgraph in storage; unfold, which restores a budget-feasible dependency-supporting subgraph at expensive checkpoints; and scoped fork, which creates a temporary least-privilege view for a specialist sub-agent and rejoins the result with explicit provenance edges. We formalize the storage graph, active-context construction, dependency closure, fork-time projection, and rejoin procedure. In LLM-based TraceOps experiments with gpt-4.1-mini, the validated fold/unfold core raises delayed-activation decision accuracy from 25.0% to 42.5%, cuts mean prompt tokens by 54%, and reduces over-commitment from 0.625 to 0.340. A deterministic selector study then isolates fork scope quality: in the mismatch setting ( $d=6$ ), dependency-scoped fork reaches the full-context performance upper bound at roughly one-third of the token cost and surpasses similarity-scoped fork under a matched token budget. A limited end-to-end workflow validation further shows that fork alone is not sufficient, but that a mixed graph-native policy can match full-history prompting accuracy (0.396) while reducing mean prompt tokens from 49.1k to 38.1k and median prompt tokens from 69.2k to 35.6k. Workflow-level comparisons show that graph-native policies improve over similarity-only retrieval and proxy summarization in long-horizon support restoration, and failure/sensitivity analyses identify remaining error sources. In a six-seed dependency perturbation study, closure-only restoration changes from 0.368 at baseline to 0.340 under 30% edge removal and 0.347 under 20% noisy-edge injection; the Mixed-Heuristic policy retains higher absolute accuracy across the same conditions (0.493, 0.493, and 0.465, respectively). Overall, the results support a focused claim: GoC introduces recoverable, graph-native context management for instrumented single-session workflows with available or constructible dependency traces, and scoped fork adds dependency-aware projection with provenance-preserving rejoin within that trace graph.