A phase-expanded periodic schedule

For a quotient that is not strongly connected, one must respect the order of reachable strongly connected components. The convex hull of every cycle in the graph can overestimate attainability from a specified initial component.

The theorem is the timed, phase-explicit version of the periodic-graph mechanism discussed by Fritz Fritz. It does not infer finite-time physical containment from an asymptotic polytope.