Manuscript En06-A@1 · En06-A.tex · definition · e04c9892
Definition: Well-founded causal executability
Device closure remains separate and withdrawn in its strong form · lines 2041–2046
Every admitted finite network must have a dependency-respecting topological ordering, and complete composition along it must be unique. A calculus refinement additionally requires well-typed composite program interfaces.
Nearby in this section
- section: Device closure remains separate and withdrawn in its strong form
- hypothesis: Hypothesis: U: Unrestricted resynchronization closure
- section: Device closure remains separate and withdrawn in its strong form
- theorem: Theorem: U excludes ordinary bidirectional relays
- section: Device closure remains separate and withdrawn in its strong form