Proposition: Acyclic dependency produces an order

If the dependency graph is acyclic, then $<$ is a strict partial order and $\le$ is a partial order.

Proof. Concatenation proves transitivity. A path from an event to itself would give a cycle, so $<$ is irreflexive. Its reflexive closure is therefore antisymmetric and transitive.