Relabeling typed reactive networks #
A bijection changes the presentation of component identities, transporting the dependent component interfaces, private states, packets, routing, token holder, and FIFO schedules together. It does not alter effects or introduce new scheduler choices.
Transport the recipient of a dependent packet along a bijection of identities.
Equations
Instances For
Present the same diagram on a different type of stable component identities.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The global environment follows the inverse bijection of component identities.
Relabel a complete residual configuration, retaining traffic order and consumed fuel.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equality of network data transports a residual configuration without executing a step.
Equations
- Interaction.Execution.ReactiveNetwork.State.castNetwork h state = h ▸ state
Instances For
Component handlers follow equality of the network's declared effect interfaces.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Transport along reflexive network equality leaves handlers unchanged.
FIFO schedules retain their order and delivery positions under relabeling.
Equations
- Interaction.Execution.ReactiveNetwork.Activation.reindex e (Interaction.Execution.ReactiveNetwork.Activation.node id) = Interaction.Execution.ReactiveNetwork.Activation.node (e.symm id)
- Interaction.Execution.ReactiveNetwork.Activation.reindex e Interaction.Execution.ReactiveNetwork.Activation.deliver = Interaction.Execution.ReactiveNetwork.Activation.deliver
Instances For
Reading a relabeled node recovers the same return, abort, or unfinished observation.
Changing an equal presentation preserves the node's actual observation.
Initialization commutes with relabeling, including the initial token holder.
Delivery respects dependent recipient types after relabeling.
FIFO queue delivery is independent of the names of its recipients.
Token execution commutes with equality of network presentations.
FIFO execution commutes with equality of network presentations, keeping the schedule.
A local activation commutes with relabeling its component and effect handler.
One scheduled FIFO operation commutes with relabeling.
Relabeling preserves every FIFO execution prefix, with all effects in their original order.
Relabeling preserves token execution, including the identity selected by control transfer.
A proved graph factorization transports complete token prefixes, including residual private states, shared service, queued traffic, control, and consumed fuel.
A proved graph factorization transports complete FIFO prefixes with exactly the same delivery positions and corresponding component activations.