Manuscript VII-J-ST@1 · VII-J-ST.tex · section · f1f1d82c
The complete timed network and exact scheduled support
The complete timed network and exact scheduled support · lines 640–645
Logical depth, hardware execution time, slicing parameter , geometric time , and clock-code labels are not identified.
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
- proposition: Proposition: What retiming preserves