Portfolio 18 · bounded stochastic workflow

AI agent workflow economics simulator

Reconcile every expected node execution, token, tool call, and human-review minute; solve independent branches exactly and reserve seeded simulation for tail latency or correlated events.

Decision this answers: What does one successful workflow cost, which node drives it, and how much reliability and p95 latency come from a hard-bounded retry policy?

Scenario

Numeric scenario inputs

Independent attempt probability for the exact bounded-retry fixture.

measured[5]

A hard termination bound; zero and unbounded loops are invalid.

exact-derived[3]

Input and output token meters reconciled for the retrying node.

measured[4]

Search, browser, database, and external API spend.

measured[2]

Review probability × minutes × loaded hourly cost.

model estimate[5]

Compatible end-to-end measured attempt latency.

measured[5]

The complete default scenario is server rendered. Interactions stay in this browser.

Decision summary

Bounded success

99.4%exact-derived

Exact terminal success within the maximum attempts.

[3]

Expected workflow cost

$0.40exact-derived

Models, tools, and expected human review.

[4][2]

Cost per successful outcome

$0.41exact-derived

Expected cost divided by bounded terminal success.

[4]

Simulated p95 latency

7.40model estimate

Seed 42, 20,000 runs; success standard error 0.001.

[5]
Direct-labeled result profile

The tables below are the accessible source of truth; bar lengths never carry identity alone.

Workflow execution ledger

Workflow execution ledger
CandidateExpected executionsToken meterExternal meterTerminationMethodEvidence
Planner1.000Input + outputNoneAcyclicExactexact-derived[3]
Tool loop1.212Per attemptTool call per attempt3 attemptsFinite geometricexact-derived[2]
Human exception0.060None4 min at 6% reachTerminal escalationExact expectationmodel estimate[5]

Method boundary

Method boundary
CandidateUse whenCorrelationUncertaintyReproducibilityEvidence
Exact expectationAcyclic independent branches or bounded retriesIndependence declaredNoneClosed formexact-derived[3]
Monte CarloTail percentiles or shared eventsExplicit shared shockStandard errorSeed + run countmodel estimate[5]

Official surface versus this site

This offline workbench

The official guidance describes workflow and agent patterns. This page adds an auditable economic graph with termination bounds, exact expectation, reproducible uncertainty, and cost per successful outcome.

Sources and methodology

Every result-affecting reference is visible here without JavaScript and is retained in the JSON export.

[1] Building effective agents
Authority
Anthropic
Native identifier
workflow and agent patterns
Unit
workflow topology
Evidence
exact-derived
As of
2026-08-01
Retrieved
2026-08-01
Freshness
reference
Normalization
The patterns define graph shapes; the site requires explicit reach, termination, and measured meters.

Open the authoritative source

[2] Tool use overview
Authority
Anthropic
Native identifier
tool use
Unit
tool calls
Evidence
measured
As of
2026-08-01
Retrieved
2026-08-01
Freshness
reference
Normalization
Tool invocations remain separate cost-bearing workflow nodes.

Open the authoritative source

[3] ADK workflow agents
Authority
Google
Native identifier
sequential, parallel, and loop agents
Unit
workflow control
Evidence
exact-derived
As of
2026-08-01
Retrieved
2026-08-01
Freshness
reference
Normalization
Loop-agent topology is accepted only with an explicit local maximum attempt bound.

Open the authoritative source

[4] OpenAI Agents SDK usage
Authority
OpenAI
Native identifier
RunResult usage
Unit
request and token usage
Evidence
measured
As of
2026-08-01
Retrieved
2026-08-01
Freshness
reference
Normalization
Usage records populate node meters; no live request or telemetry is sent by this page.

Open the authoritative source

[5] OpenAI Agents SDK tracing
Authority
OpenAI
Native identifier
traces and spans
Unit
node latency and reach
Evidence
measured
As of
2026-08-01
Retrieved
2026-08-01
Freshness
reference
Normalization
Compatible exported measurements inform reaches and latencies; the calculator itself remains offline.

Open the authoritative source

Limits and non-claims

  • Branch independence is an explicit model choice; shared failures and latency shocks require simulation.
  • Averages do not prove p95 latency. The tail result is labeled with seed, run count, and sampling error.
  • Success probability, expected cost, cost per success, and tail latency remain separate decision metrics.