Timed periodic dependency models

Let $Q$ be a finite strongly connected quotient graph. Each edge has displacement ${\Delta }_e$ and duration $u_e>0$; translated copies of its lift and waiting are allowed. For a simple directed cycle $a$, put