Definition: Admissible graph and experiment

A graph is admissible if every principal past is finite and there is a common finite bound on indegree and outdegree. A finite experiment is a finite down-set $D\subseteq E$. A schedule is a linear extension of the induced order on $D$.