Shared waters

Reading & provenance

A route back
to the ideas.

Three corrected drawings are a starting point for understanding. They preserve a route from the original question to a source concept, a visible construction and its limits.

Ends · ways · means

The End stays open.

Understand how one or another method for composing open systems works in a familiar SMR/depot and organisational context. Then explore how much it helps define useful chunks of work, capability, scope, resource or service.

Deriving useful project work through a sound formalisation remains the stretch ambition. Any such result must distinguish what was derived from the change patterns and assumptions we supplied.

These first means are deliberately small

Attempt01 constructs a finite graph join and a graph map. Attempt02 makes an explicit inventory correspondence. Attempt03 evaluates a finite compatibility and capacity relation.

They do not collectively establish a universal ontology or a single integrated theory. Each gives one part of the original exploration a precise, visible meaning.

The reading behind the attempts.

The ten records in the curated dynamics/sharing cluster were reread for this essai. A source can motivate a distinction without its full formal machinery being implemented. The per-attempt notes say exactly what is borrowed and where our small construction begins.

  1. Willems, The Behavioral Approach to Open and Interconnected Systems
    Printed pp.46–54,60–64,70: behavior, local modules, interfaces and state as sufficient memory. Direction and institutional authority require care.
  2. The Behavioral Approach to Systems Theory · n-Category Café
    An accessible bridge to behavior and latent variables. Possible histories alone have no probability distribution; the primary paper qualifies the article’s directionality criticism.
  3. Libkind, An Algebra of Resource Sharing Machines
    §2.2: matching observations and possible deadlock; §5: the full construction and its hypotheses. Attempt03 uses only a finite snapshot compatibility relation.
  4. Libkind & Fairbanks, Undirected composition
    The common-pool and nested ecosystem examples distinguish shared variables from contributions to dynamics, and expose double counting.
  5. Baez, Complex Adaptive System Design · part3
    Typed composition syntax and its interpretation are different things.
  6. Baez · part4
    Distinguish network kinds and concrete instances; choose appropriate relation types.
  7. Baez · part5
    Refinement can require search; forgetting constraints need not preserve composition.
  8. Baez · part6
    A network model supplies actual assignments and combination rules, not merely arrows named “functor”.
  9. Baez · part8
    Agent/commitment networks differ from states and tasks for a specified team. A prerequisite join requires every input.
  10. Baez · part9
    Conserved catalysts and sequential reuse do not mean unlimited parallel availability.

Careful source reading and selected notation/figure checks are not an independent proof audit. The saved part4 capture has a page-count/extraction discrepancy; the substantive author text was checked against the original article.

Three source drawings, three corrections.

2022 GraphMLCorrected first attemptLeft unresolved
Open Graphs as a double categoryExplicit boundary gluing; endpoint-preserving graph mapDouble-category structure and semantic preservation
Basic functor setup for TOMTyped organisational inventory and authored correspondenceDerivation of work, WBS product and functor laws
TOM open systems second attemptTyped process surroundings; separate version and capacity conditionsFull dynamical transitions, SMC and schedule extraction

The original source files are preserved. Nesting was read as structural evidence, not assumed to be a valid ontology. Unnamed arrows, duplicated labels and isolated nodes were not silently completed as facts.

Source hashes, model definitions and reading record

23 October 2026 · Essai 04

From compatible snapshots to a service trace.

Same parts, different capability joins three local transition relations, tests a complete two-step trace and retains protocol and team state. A request, temporary inhibition, institutional permission and actual model occurrence remain separate from standing capability. The earlier three attempts remain intact.

The additional source is Calhau, Almeida and Guizzardi, Systems and their Emergent Dispositions: Towards an Ontological Foundation (2026), pp.2–7. Its ontological distinctions inform the authored model; its illustrative organisational example does not validate this rehearsal or real organisational outcomes.

The ten-source set above was freshly reread again for this essai, together with the full nine-page 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. The new construction adds a concrete counterexample to premature abstraction and an independently enumerated check of nested versus flat composition. Read the dated scope and coverage record.

What could come next?

The new rehearsal supplies a minimal transition model and one explicit history boundary. What extra state is needed for safe interruption, uncontrolled reconfiguration or several competing service requests? Can a declared library of changes turn a lost capability into candidate work with a feasible owner and cost?

These remain open directions; the finite rehearsal does not settle them.