A Schedule is a means to order events. Schedules are a kind of Map where the key is time (an integer), and the value is an Action.
Schedules can repeat a tiling of events
Schedules can use a relativistic notion of time (relative to when they are activated) or an absolute notion of time (relative to when their earliest peer started).
Schedules can be given a policy on how to handle concurrent events.
A Schedule is an active data structure. Actions can be added or removed in an ongoing fashion. This is called dynamic scheduling.