📐 Agent DAG Equation

We model an execution mesh M as a directed acyclic graph:

Where:

• M = (N, E) are agent nodes

• T_M = max( tₙ(spawn) + tₙ(exec) ) for all n ∈ N defines flow dependencies

TTL of the graph is defined as:

Agents auto-expire after or conditional failure.