# Workflow graphs and explicit state Canonical: https://semiaifoundry.com/learn/atlas/workflow-graphs-state/ Revision: 2026-10-07 Rights: https://semiaifoundry.com/ai-atlas/licenses.html From request to durable action · Atlas v1.3.0 # Workflow graphs and explicit state Compare a fixed DAG/state machine, model-assisted node and model-directed tool choice on one task. [Explore in Atlas](https://semiaifoundry.com/ai-atlas/#workflow-graphs-state)Logical state, task evidence and declared units; no physical assembly scale Learning objectiveIdentify the owner of each transition and distinguish workflow completion from a satisfied external goal. ## The mechanism A workflow represents progress as state and permitted transitions. A node may compute a value, call a service, wait for input or select the next step. The important distinction is who chooses the transition and what evidence permits it. A fixed workflow follows authored control flow; a model-assisted workflow can use a prediction inside that flow; a model-directed system can propose its next operation from observations. None of these designs can turn a proposed tool call into an authorized effect by itself. The durable incident example compares a fixed workflow with an authored branching policy on the same environment and task. The latter can repair one malformed argument yet still choose the wrong manual fact. Its extra branches are visible source logic, not learned reasoning. Separating business state from the last message also makes the end condition testable: a worker can report completion while inventory or the work order is wrong. 1. The incident identity, target asset and allowed effects define a task before any node executes. 2. A transition consumes the current state and a recorded event; each tool node passes through validation and authority. 3. A review state stores an exact proposed action and waits for a decision instead of treating the wait as failure. 4. The policy can stop, retry or choose a next tool, but the independent environment checker evaluates the completed business state. ## Science and assumptions ### Workflow graphs and explicit state · explicit relationship $$ s_{n+1}=f(s_n,e_n) $$ The next workflow state is obtained by applying the declared transition function to the current state and observed event. Symbols and units sₙ Workflow state after n recorded transitions state object eₙ Input, tool result or review event for this transition event object f Declared transition function state transition For incident-017, both authored modes read FAN-7, obtain reference facts, reserve two FILTER-A units after review and create one linked work order. The normal run uses four calls. If the reference list begins with FAN-9, the fixed workflow selects the requested asset while the authored first-fact policy uses FAN-9. Both can reach their internal completed state. Only the FAN-7 environment satisfies the original goal. The comparison therefore measures the task after execution rather than rewarding a particular graph shape or the number of tool calls. Assumptions This denotes an authored transition system. It does not state that a stochastic model policy is deterministic unless its returned decisions are recorded. ## Engineering example For incident-017, both authored modes read FAN-7, obtain reference facts, reserve two FILTER-A units after review and create one linked work order. The normal run uses four calls. If the reference list begins with FAN-9, the fixed workflow selects the requested asset while the authored first-fact policy uses FAN-9. Both can reach their internal completed state. Only the FAN-7 environment satisfies the original goal. The comparison therefore measures the task after execution rather than rewarding a particular graph shape or the number of tool calls. ## Distinctions and tradeoffs A graph containing an AI node is not automatically a model-directed agent. A fixed path is easy to inspect but needs explicit recovery branches; dynamic choice can adapt and can also choose an incorrect next action. AI becomes useful through the surrounding execution and verification system, not merely through a model invocation. ## Specifications and interfaces Mechanism boundary What decides the next step? This denotes an authored transition system. It does not state that a stochastic model policy is deterministic unless its returned decisions are recorded. Evidence type Authored worked example The durable incident experience executes typed fixture tools, authority checks, exact review, receipts and independent final-state checks. Its policies are authored code and its storage boundary is local; it is not a real model or production workflow platform. ### Interfaces Declared input and state Input The incident identity, target asset and allowed effects define a task before any node executes. Checked outcome Output Identify the owner of each transition and distinguish workflow completion from a satisfied external goal. ## Check your understanding ### What establishes that this incident was correctly handled? 1. The final environment matches the task and policy constraints 2. The last node is named complete 3. The graph contains more than one tool Answer and reasoning The final environment matches the task and policy constraints A completion label is a control state; the independently checked environment establishes the task result. ## Evidence and scope The durable incident experience executes typed fixture tools, authority checks, exact review, receipts and independent final-state checks. Its policies are authored code and its storage boundary is local; it is not a real model or production workflow platform. The quantities and fixtures are authored. Source scope is recorded in the automation learning review manifest; no source benchmark or private system behavior is claimed. This denotes an authored transition system. It does not state that a stochastic model policy is deterministic unless its returned decisions are recorded. The durable incident experience executes typed fixture tools, authority checks, exact review, receipts and independent final-state checks. Its policies are authored code and its storage boundary is local; it is not a real model or production workflow platform. ## Sources - [Building effective agents](https://www.anthropic.com/engineering/building-effective-agents) - [LangGraph workflows and agents](https://docs.langchain.com/oss/python/langgraph/workflows-agents) - [n8n AI Agent node](https://docs.n8n.io/integrations/builtin/cluster-nodes/root-nodes/n8n-nodes-langchain.agent) [Published lesson data](https://semiaifoundry.com/ai-atlas/lesson-data/workflow-graphs-state-44fd1755c7c48aed.json) · [Atlas releases and licensing](https://semiaifoundry.com/ai-atlas/licenses.html) ## Continue exploring ### Foundations - [Tools, memory & agent loop](https://semiaifoundry.com/learn/atlas/tool-loop/) - [Evaluation & the AGI frontier](https://semiaifoundry.com/learn/atlas/evaluation/)