Agentic Graphs

Use a controller-owned directed acyclic graph as the execution state. Parallelize only independent nodes; preserve one integration authority.

Build and execute the graph

1. Define the overall outcome, global constraints, integration owner, and final acceptance criteria.
2. Create atomic nodes with one objective, dependencies, acceptance checks and per-criterion results, expected artifacts, canonical write scope, retry limit, and assigned capability.
3. Validate the graph before dispatch. Reject duplicate IDs, self-dependencies, missing dependencies, cycles, noncanonical scope aliases, and simultaneously running nodes with overlapping write scopes.
4. Mark nodes ready only when every dependency is complete. Dispatch independent ready nodes in parallel when capacity and risk permit.
5. Give each worker only its node contract and required upstream artifacts. Require a handoff with evidence, changed artifacts, verification, residual risks, and discovered work.
6. Validate each handoff against node acceptance. Require verification evidence and changed artifacts declared by the node, plus explicit residual risks and discovered work. Mark it complete only after every check passes; otherwise retry within budget or mark failed.
7. Add, split, merge, or rewire nodes when new evidence changes the work. Require revision IDs to resolve to graph nodes and back every replaces relationship with one revision that adds the replacement and supersedes the old node. Reject replacement cycles and any revision that supersedes a node before an earlier revision introduces it. Revalidate the entire graph after every structural revision.
8. Let the controller resolve merge conflicts, shared interfaces, and final integration. Finish only when all required nodes and global acceptance criteria pass and the integration owner records global verification evidence.

Coordinate writes and failures