Essai 04 · 23 October 2026
Same parts.
Different capability.
An operator and a depot receiver can each perform their own part. Can their arrangement complete a shared service handover? And if it can, why might no service happen?
This extends the earlier version-and-capacity snapshot with two actual model transitions and a retained protocol. It is a synthetic rehearsal around the depot scenario, not a model of power generation or nuclear feasibility.
End · way · means
Make the relation do some work.
The End is to understand what composition contributes to a usable service capability. The way is to join three local transition relations, retaining the shared protocol and the team's state. The means is this small, inspectable model.
Keep the inventory fixed: one operator, one receiver, their console, one shared service team and an interlock. Protocol A/B are supported console settings, not new people or equipment. Only the arrangement and current situation change.
Try these contrasts
- Keep A/A and the link: a complete route exists, even with no request or permission.
- Disconnect the link, or choose A/B: the same parts lose their joint route.
- Restore A/A, add a request and permission A: start a rehearsal.
- Trip the interlock during the run: completion stops, while the standing capability remains.
- Clear it and complete: only now does a synthetic service event exist.
A handover, in two steps.
In this model, “capable” means a compatible ready → active → done route exists under declared opportunity conditions. It does not promise reliable performance in the world. Permission is a separate, version-specific rule; it is never inferred from that route.
Ephemeral rehearsal. Controls change only this page. Nothing is saved, sent, dispatched or approved. Completed events appear below in this page’s history; reset, reload or closing the page clears them. There is no file or durable record to reopen elsewhere.
The next step is blocked.
A request and permission are needed.
No synthetic event yet. The initial phase is ready.
During an active run, protocol, connection and team allocation are held fixed. The request is consumed at start. Permission can be withdrawn or the interlock tripped before completion. The team then stays held until completion or an explicit reset of this ephemeral rehearsal. Current phase: ready.
Inspect the actual joined transition relation
Natural join agrees on action, before/after phase and protocol wherever those fields occur in both local tables. Private operator, depot and team states are retained. The missing-link rule yields no joint transitions. Reachability is then searched over this table.
| Action | Shared phase | Protocol | Operator | Depot | Team |
|---|
No compatible joint transitions.
Complete route:
Each local module contributes two rows. The operator and depot carry the protocol; the team carries its free/held state. This is a finite relational construction with authored synchronisation rules. It is not an implementation of Libkind’s full categorical machinery.
This page’s run history
No completed synthetic service events. Starting a run does not add a completed event.
Open an event to inspect its receipt. To try a correction, prepare another run, change the settings and complete it; earlier events remain until reset or reload. No cross-session correction or deletion service is implied.
A useful failure of simplification
Hide the protocol too early, and a false route appears.
Hold operator A and depot B. Both still have local start/finish steps. Compare the same two operations in a different order:
Compose → forget the version
A cannot join B. No detailed joint transition exists. Removing the protocol field afterward cannot recover a route.
0 joint transitions · no service trace
Forget the version → compose
After both versions are hidden, the start/finish rows appear compatible. The abstract model admits a complete route with no compatible detailed witness.
2 apparent transitions · start → finish
Computed from the same local relations as the rehearsal. This small counterexample shows why this particular projection is unsafe for deciding compatibility. It is not a claim that every abstraction fails.
What this has constructed.
| Question | Answer in this essai | Boundary |
|---|---|---|
| What survives a rewire? | The fixed component inventory and each component’s local start/finish repertoire. | A lost connection or mismatched protocol removes the system route. |
| Is capability an event? | No. A compatible complete route may exist without a request, permission or occurrence. | Existential reachability is a deliberately weak proxy for standing capability; it does not establish robustness, skills or performance. |
| What history matters? | The active phase, retained protocol, held team and earlier synthetic receipts. | No elapsed time, stochastic reliability, queue, genuine authorisation system or uncontrolled reconfiguration is modeled. |
| Does nesting matter? | Joining (operator + depot) + team equals operator + (depot + team) for these finite relations. | Automated tests check both nestings and a separately enumerated flat join. No general operad or functor theorem is claimed. |
| Does this derive project work? | It locates a difference: absent link, protocol disagreement, absent trigger, current mask or authority. | It supplies no causal repair library, cost, responsible owner or generated work package. Turning a diagnosis into a feasible change remains open. |
Source → concept → construction → limit.
| Source and locator | Concept used | Our construction and its limit |
|---|---|---|
| Calhau, Almeida & Guizzardi (2026), Systems and their Emergent Dispositions, pp.2–7, figs.1–2 | System dispositions depend on interacting component dispositions; disposition and manifestation differ. Reciprocal, enabling and disabling relations are distinct. | Compatible operator/receiver transitions, a triggering request, an inhibiting interlock and a distinct event. These operational rules are authored here. The paper supplies an ontology and illustration, not validated organisational effectiveness. Additional, subtractive and disposition-changing relations are not implemented. |
| Libkind (2020), An Algebra of Resource Sharing Machines, §2.2, p.7; §5, pp.18–19 | Shared observations constrain joint steps before and after a transition; locally possible behavior can fail to compose. | A finite synchronized relation, retaining both endpoints and protocol. The label/phase conventions are declared here. No full resource-sharing-machine algebra is claimed. |
| Willems (2007), printed pp.46–54, 59–64, 70 | Allowed behavior, local modules, latent information and state as enough memory. | A finite two-step trace with a latched protocol and team. No continuous dynamics, linear-system theorem, probabilities or claim that a policy restriction grants authority. |
| Baez, part 5, forgetting-constraints example; Libkind & Fairbanks, nested ecosystem example | Forgetting a constraint can fail to preserve composition; nesting must preserve the intended interpretation. | The executable A/B counterexample and nested/flat join check. This joins finite relations; it does not sum continuous contributions or claim to implement the sources’ full algebras. |
| Baez, part 9, catalyst/reuse discussion | One reusable participant is not unlimited parallel availability. | One team is held across the active step and released at completion. This is a single-run machine, not a scheduler or a Petri-net implementation. |
All ten mandatory sources were freshly reread for this essai, alongside the full nine-page dispositions paper. The saved Baez part 4 capture yielded 15 text sections against 16 reported pages; its unavailable final page was not counted as read, and the substantive original article was cross-checked directly. Reading coverage, extraction limits and checks · Full source set and earlier constructions.