Manuscript VII-J-ST@1 · VII-J-ST.tex · proposition · f1f1d82c
Proposition: What retiming preserves
The complete timed network and exact scheduled support · lines 627–640 · proof included or linked
VII-J-ST@1#prop:retiming
Swapping adjacent independent channel nodes acting on disjoint factors preserves the complete channel, including records and references. It need not preserve an assigned physical timing certificate.
Proof. The two tensor-factor maps commute, also after amplification. A finite sequence of such swaps preserves their composition. Their new assigned port times need not satisfy the original causal inequalities, which are separate hypotheses.
Nearby in this section
- definition: Definition: Complete finite network
- section: The complete timed network and exact scheduled support
- theorem: Theorem: Complete scheduled-support bound
- section: The complete timed network and exact scheduled support
- corollary: Corollary: Partitioned metric envelope
- section: The complete timed network and exact scheduled support
- example: Example: Strictness of the first distinction
- section: The complete timed network and exact scheduled support