A phase-expanded periodic schedule

A periodic dependency model has a finite quotient graph $Q$. Its vertices include register type and schedule phase. Each edge $e$ has displacement ${\Delta }_e\in {\mathbb{R}}^d$ and duration $T_e\ge T_{\min }>0$. Its periodic lift permits translated copies of each transition. Waiting at a port is allowed.

Assume $Q$ is strongly connected. For a simple directed cycle $c$, set

There are finitely many simple cycles. Define