Composing work packages

Foray 160 · A timed-history essai

Good snapshots.
Bad history?

A roof package changes from drawing A to B. The schedule, resource allocation and approval register each update correctly. Does their combined history still permit the work?

Two histories can finish with exactly the same records. In one, a short coordination gap closes before work. In another, the gap lasts too long—or work proceeds inside it. The final picture cannot tell them apart.

The End

Understand what a work package must expose so that its interactions remain intelligible over time.

The Way

Compose independently changing views of one package. Compare endpoint checks, an always-agree invariant and a time-bounded recovery obligation.

The Means

A fictional finite transition system, timed traces and a complete small interleaving census. Real recovery limits and responsible authority remain to be established.

One package, three views.

Schedule viewDrawing revision
A
idle
Resource viewAllocation prepared for
A
Approval viewRecorded release for
A

Shared package identity · revision agreement checked across all three views

Each register may adopt B once. The schedule may do so only before work starts; its work phase goes idle → active → done. Resource and approval updates may interleave with those schedule steps. A local step can therefore be valid while the joint state is unacceptable. The approval view is an authored record in this toy, not an actual granting authority.

Declared policy: work may be active only while all three revisions agree. A mismatch while work is inactive may last at most k elapsed minutes. Agreement must be restored by the deadline. Later recovery does not erase an earlier breach.

Try a history.

Ephemeral research rehearsal. Controls edit only this page. Evaluating creates a named receipt in this page’s History. No file, durable record, dispatch or approval is created. Reload, reset or closing the page clears entries and receipts. A correction makes a new receipt and retains the previous one until reset.
Load a worked case

Loading replaces the editable trace, keeping receipts. The reference controls below always use k = 2; your chosen bound changes your trace and the census.

Append one locally valid event

Brief-recovery example loaded. Inspect the trace or begin an empty one.

MinuteEventScheduleResourceApprovalWork
Start + final snapshot

Check agreement only at the two endpoints. Intermediate states disappear.

Strict invariant

Require agreement at every recorded state. Reject even an authorised coordination interval.

Bounded history rule

Create a receipt for this evaluation

This page’s History

No receipts yet.

    Open a named receipt again from History. Choose “Revise this attempt” to copy its inputs, edit them, and evaluate a new attempt. History is intentionally cleared on reload; there is no Files entry or cross-session recovery.

    Neither simpler check wins by definition.

    These five controls use the declared policy above and k = 2. The expected classifications are authored test labels, not observations of real projects. “Pending” is a live obligation, never a successful completed recovery.

    ControlExpected under policyEndpointsStrictBounded

    All locally valid orders of the same five updates

    Schedule adopts B, resource adopts B, approval adopts B, start and finish occur at minutes 1–5. Schedule B precedes start, which precedes finish; the two other updates may occur anywhere. This produces 20 interleavings. Every one has the same locally valid start and final state. Click an order to inspect it.

    Inspect all 20 interleavings
    OrderBounded ruleExplore

    What is the mathematical construction?

    State σ = (schedule revision, resource revision, approval revision, work phase) σ₀ = (A, A, A, idle) The schedule viewpoint contains both its revision and work phase. Local transitions: one register update, or one schedule-phase step Trace τ = (time₀, σ₀), (time₁, σ₁), …, (timeₙ, σₙ) M(σ) := not all three revisions agree φ(σ) := active work implies not M(σ) ψ(τ) := each maximal mismatch interval closes within k elapsed minutes C(τ) := every φ holds AND ψ holds Finite prefix: an unexpired open interval is PENDING. A closed interval of exactly k minutes is allowed. An observed unclosed interval older than k is REJECTED.

    States hold between event timestamps. “Observe without an update” advances time and can reveal an overdue gap. The monitor uses elapsed minutes, not number of events: adding observations does not spend recovery time unless time passes. With no new observation, the page does not claim to know the real clock.

    The picture preserves which viewpoint changed, revision agreement, work phase and elapsed time. It omits people, physical readiness, costs, contested evidence, partial approvals, concurrent writes, clock uncertainty and engineering risk. This is an explicit trace filter, not a controller that enforces compliance.

    A timestamped state table with the same monitor can express exactly the same rules. The visualisation contributes legibility and a reusable separation between local steps, hard exclusions and recovery obligations; no exclusive expressive power or measured practical advantage is claimed. Remembering the mismatch start time in an augmented state can also turn the deadline into an invariant: the distinction is about information retained, not a claim that invariants are inherently incapable.

    What has changed relative to earlier work?

    The drawing that forks checks interpreted agreement at the end of composed wiring. Here the same final agreement hides a breach in the middle. Shared waters: Same parts, different capability retains a protocol and team through synchronized ready → active → done steps. This essai instead composes asynchronous view updates and distinguishes two finite histories with identical endpoints by the duration and location of a mismatch.

    The bounded result is constructive: local rules generate the 20 candidate orders; the policy filters them and identifies admissible alternatives. It does not derive the policy, an optimal schedule or responsible repair work. The new research question is which recovery memory belongs at a reusable package boundary, and whether that boundary remains sufficient when another package shares the same resource.

    Source → concept → construction → limit.

    Source and locatorConcept usedConstruction and limit
    Bucchiarone, Pierantonio & Vangheluwe (2026), Synergic modeling of coherent systems, §3.1–3.4, PDF pp.7–9; §4.1–4.4, pp.10–12.Cross-viewpoint transitions and interleavings; admissibility combines a pointwise predicate φ and a trajectory predicate ψ.Three project registers; a hard work exclusion and a timed recovery episode. The project translation, finite observation rule, thresholds and all data are authored here. We use the paper’s trace-filter account; we do not claim its complete DCN implementation or a new theorem.
    Same paper, §8.2–8.4, PDF pp.17–18.Applicability, missing operational enforcement semantics, integration, empirical evaluation and scalability limits.Small synthetic trace checks only. This model does not validate the paper’s general framework, system identity claim, biological example or project effectiveness. No enforcement or safety system.
    Foray 160, Essai 04 and Foray 170, Essai 04.Existing executable comparators: interpreted revision agreement; protocol-compatible synchronized transitions and retained team.Preserved as earlier, separate constructions. Novelty here is bounded elapsed recovery across asynchronous updates, not merely adding a second route or more boxes.

    Original paper consulted at PDF pp.1,6–12,17–18. The construction does not rely on the paper’s abstraction-independence proposition: removing stuttering or timestamps would need additional conditions for a bounded-time property. All source claims above are paraphrases. Inspect the model source and independently written test oracle.

    Back to composing work packages · All experiments in this enquiry