Definition: Legal schedule

A legal schedule is a finite chronological word in

with declared parameters, modules, and supports, satisfying:

1. every input lies in its command's certified domain;

2. flow preserves the packet and module and does not cross an incidence value internally;

3. source replacement satisfies its regular boundary, stage, token-promise, module, and source-permission conditions;

4. incidence satisfies its exact profile, germ-mode, clock, and incidence-permission conditions;

5. no command combines source replacement and incidence;

6. all commands after source replacement use the newly installed packet, charts, collar, realization, and report dictionary;

7. original names occupy valid input locations and receive their certified transport;

8. no unsupported profile or module conversion occurs;

9. every output satisfies all realization requirements and (E1)–(E5), including prop:complete-output.

Canonical code predicates concern finite indices, exact clocks, reports, permissions, locations, and stages. The token promise is instead a hypothesis about the matter state, not a circuit-tested predicate.