The complete timed network and exact scheduled support

For a conservative dependency graph, connect every input of a gate to every output. A reduced dependency graph is admissible only if it has a proved support statement for every joint subset of that gate's outputs, including references. Single-output no-signalling alone is insufficient.

For joint terminal output $B$, let ${\mathrm{Sch}}^{-}(B)$ be the model input factors with a directed dependency path to $B$.