Optional ReadonlybudgetThe budget checked against — absent when there is none.
ReadonlycriticalThe stages of the slowest path, in the order a run first reaches them — the path that makes worstCaseMs,
or knownMs when a path is unbounded. knownMs = Σ passes × (attempts × (timeoutMs ?? 0) + backoffMs).
ReadonlyknownThe worst case of what IS bounded: an unbounded stage counts 0, an unassumed loop one pass.
ReadonlyoverknownMs > budgetMs: the declared policies allow longer than the budget. Always false without one.
ReadonlyunboundedEvery stage that keeps a path unbounded, each named once, in chart order.
ReadonlyworstThe worst case of the slowest path — null when any path is unbounded (see unbounded).
What
timeBudget(chart)reports. JSON-safe and frozen.