Definition A. Given a distributed computation transcript trans = (G, linp, data) and any edge (v, w) ∈ E, we denote by ttrans,C(v, w) the time required to evaluate C(data(v, w); linp(v), inputs(v)). We say that trans is B-bounded if ttrans,C(v, w) ≤ B for every edge (v, w).
Appears in 3 contracts
Sources: Byzantine Agreement, Byzantine Agreement, Byzantine Agreement