pub fn trace_poset(ops: &[Op]) -> ProofPosetExpand description
The commutation poset of a set of concurrent operations: independent pairs (Bernstein) are left unordered — their commutation is a 2-cell — and conflicting pairs get a program-order edge (lower index first), which is the only way to keep a deterministic execution. The trace’s cube complex.