TLDR
- A twin is a planning surface, not a second source of truth.
- Useful coupling is asymmetric: live state enters automatically; proposed action exits only through authority.
- Every plan is relative to a versioned observation cut and expires as the world changes.
- Receipts prove processing; independent readback proves the intended outcome.
- Build the smallest twin that can reject unsafe plans, not the largest replica you can afford.
At 09:02, Cedar Depot has four unoccupied cold-storage slots. A planning agent receives a request to move four temperature-sensitive pallets from the receiving bay before their dwell-time limit expires. Its operational twin shows four free positions in Zone B, so the agent produces a neat sequence: reserve B-17 to B-20, dispatch the carrier, scan each pallet, then close the transfer.
At 09:03, another system accepts an inbound shipment and reserves B-20. The twin has not yet consumed that event. At 09:04, the agent executes the plan through a convenient write endpoint attached to the twin. Three moves succeed. The fourth is accepted by the twin, rejected by the warehouse system, and still appears complete on the agent’s screen. The planner has confused three different things: a modelled future, an authorised action and an observed outcome.
The tempting repair is to make the twin faster and more detailed. Stream every event. Recreate every business rule. Let the twin drive the live system so the two cannot disagree. That intuition hides the crucial assumption: that greater descriptive fidelity should confer greater operational authority. It should not. A map may become exquisitely accurate without becoming the territory’s government.
The safer design makes a sharper separation. The agent may explore branches in a stateful model. It may estimate consequences, reject plans that violate known invariants and explain why one route dominates another. Yet its output remains a proposal. A separate authority kernel checks current identity, policy, live preconditions and action semantics. The authoritative system performs the effect. A receipt records what it processed, and an independent readback establishes what became true.
The operational twin is a source of possibility, not a source of permission.
This paper develops that architecture from first principles. The warehouse is synthetic, but the mechanism applies wherever agents plan over changing state: payment operations, network changes, clinical scheduling, energy dispatch, inventory, transport, maintenance and access administration. The argument is not that every such system needs a twin. It is that, when planning requires a stateful shadow, safety comes from a deliberate asymmetry between knowing and doing.
A shadow that must not become a second machine
Digital-twin literature begins with a useful family resemblance. A twin is a data-connected representation of some real entity or process, kept synchronised at a frequency and fidelity chosen for a purpose. The Digital Twin Consortium emphasises representation, synchronisation, historical state and simulated futures. ISO 23247 supplies manufacturing principles and a reference architecture. NIST adds a warning that matters here: digital twins can concentrate information and remote-control capability, so compromise or divergence can produce false views and consequential effects.[1][2][3]
An operational twin, as used in this paper, is narrower than that broad category. It is a purpose-bounded, stateful model used to rehearse decisions against an operating process. It may combine observed state, explicit rules, predicted transitions and uncertainty. It is not required to reproduce every property of the live system. It is required to preserve the properties that determine whether the proposed decision remains admissible.
Evidence statusPublished foundation and practitioner synthesis
The need for synchronisation, declared purpose, verification, validation and uncertainty quantification is established in standards and engineering literature.[4][5] The term authority-asymmetric operational twin and the contract developed below are practitioner synthesis. They are proposed control structures, not an existing standard.
Why not call any database copy a twin? Because a copy answers “what did we last observe?” while a useful operational twin also answers counterfactual questions: “what would likely happen if we reserved these slots, delayed this task or changed this route?” Why not call it a simulator? Because it is tied to a named operating boundary, refreshed from that boundary and judged against current operational decisions. Why not call it the world state? Because world state is whatever the authoritative process currently recognises, while twin state is a versioned claim about that world.
Thought experiment 1The seven-minute mirror
Imagine two twins with identical code, rules and data fields. Twin A receives an inventory event in 20 milliseconds. Twin B receives it seven minutes later. Both generate the same four-pallet plan at 09:04. Which twin is “the intelligent one”? Nothing about their planning method differs. Only the relationship between snapshot time and decision time has changed.
Now change one more variable. Before execution, both plans are checked against the live reservation count. Twin A passes. Twin B fails safely. The lesson is more than “fresh data is good”. It is that freshness belongs to the action’s precondition, not to the twin’s reputation. A generally credible model can still be unusable for a particular decision whose validity window is shorter than its observation delay.
The smallest useful shadow
Suppose Cedar Depot has ten cold-storage positions. Six are occupied. A transfer of four pallets appears feasible. A full replica might model carrier routes, compressor duty cycles, labour availability, door openings, energy prices and every barcode transition. The immediate decision, however, depends on only four causal properties: authoritative occupancy, outstanding reservations, temperature compatibility and whether the destination is accepting transfers.
Worked example 1A capacity check that can be followed mentally
The twin observes six occupied positions and no pending reservation. Its point estimate says 6 + 4 = 10, so the plan fits. But the observation feed may lag by at most one reservation. Represent that uncertainty as an additional occupancy of either zero or one. The feasible totals are therefore ten and eleven. Because one admissible live state violates capacity, the twin must label the plan conditionally infeasible, even though its most likely branch fits exactly.
This tiny example exposes logic that a fluent plan can hide. The useful twin is not the one that renders the warehouse most beautifully. It is the one that represents the uncertainty capable of changing the decision.
Model scope should follow decision sensitivity. Add a state variable when changing it within a plausible range can change the proposed action, its ranking or its admissibility. Otherwise, the field may be operationally informative but is not load-bearing for this twin. This purpose test keeps the shadow small enough to validate, inspect and discard when its assumptions expire.
The asymmetry that keeps possibility separate from authority
A twin needs a close relationship with the live operation, but “close” hides two different couplings. Epistemic coupling determines how observations enter the model, how quickly they arrive, how provenance is retained and how model error is measured. Normative coupling determines whether anything inside the model is allowed to change the live world.
These couplings should not rise together by default. High-rate observations, rich history and good calibration may justify more confident forecasts. They do not justify a write credential. Evidence about what will happen is not authority to make it happen. This distinction resembles zero-trust architecture’s resource-centred refusal of implicit trust: authentication and authorisation remain explicit even when the surrounding network appears familiar.[6]
Thought experiment 2The one-bit authority swap
Clone the entire Cedar system. The models, data, prompts, rules and proposed plan are identical. In System Left, the twin’s service account may write reservations directly. In System Right, it may emit only a signed TransferProposal that an independent policy decision point evaluates. Flip no other bit.
Both systems will look equally capable during a clean demonstration. Inject a policy change between planning and execution. System Left performs an action no longer permitted. System Right rejects it. The safety difference did not come from a better model. It came from property placement. Authority outside the probabilistic planner remains enforceable even when the planner is stale, mistaken or compromised.
The operational-twin contract
The boundary becomes implementable when it is written as a contract rather than left as an architectural intention. Eight fields are enough for a smallest useful version. They do not describe the whole twin. They describe what must be true for another component to rely on it.
| Field | Required content | Decision question |
|---|---|---|
| Boundary and identity | Named live process, entities and twin version | What exactly is being shadowed? |
| Observation cut | Source versions, event watermark and capture time | What world could the plan have known? |
| State schema | Typed variables, units, allowed missingness | What claims can the twin make? |
| Uncertainty envelope | Lag, measurement error and model alternatives | Which nearby worlds must remain safe? |
| Transition model | How candidate actions change modelled state | What consequence is being predicted? |
| Invariants | Capacity, safety, policy and sequencing constraints | What must no branch violate? |
| Typed action contract | Actor, subject, purpose, preconditions, expiry, idempotency key | What may be proposed for execution? |
| Reconciliation rule | Effect receipt, readback, timeout and compensation logic | How will model and world be brought back into agreement? |
The contract prevents several category errors. A prediction is not a precondition. A precondition is not a permission. A permission is not an effect. An effect receipt is not a verified outcome. Each stage has a different issuer, failure mode and evidential meaning.
MechanismThe release rule
Let x̂τ be the twin’s state at observation cut τ. Let Uτ be the set of live states still plausible given lag and measurement error. Let a be the proposed action, P the current policy decision, G(x,a) the live preconditions and I(x,a) the operational invariants.
The universal condition is the important one. The action is released only if it remains safe across every materially plausible state, rather than only the twin’s preferred point estimate. This is conservative by design. Where the cost of abstention is high, the remedy is better observation or a narrower reversible action, not permission to pretend uncertainty is absent.
Worked example 2Cedar’s configured transfer
The planner receives intent: move pallets P41–P44 from Receiving to Zone B before 09:20. The twin records snapshot warehouse-v1842, policy bundle cold-chain-v31 and an event watermark ending at 09:02:58. It simulates two routes and selects the shorter one. The resulting proposal names the four pallets, candidate slots, expected completion time, maximum acceptable snapshot age of 30 seconds, precondition available_slots ≥ 4, and idempotency key move-2026-1842-07.
At the authority boundary, the proposal is already 66 seconds old. The kernel does not ask the model whether that feels stale. It compares the typed expiry with a trusted clock, queries the system of record and finds only three unreserved slots. The proposal is rejected with reason LIVE_PRECONDITION_FAILED. The twin is then reconciled to the new reservation event. No pallet moves, and the agent can re-plan. The rejected plan is evidence that the control worked, not evidence that the agent failed to reason.
flowchart LR A["A shadow that must not become<br/>a second machine"] --> B["The asymmetry that keeps<br/>possibility separate from<br/>authority"] B --> C["Plans that survive a changing<br/>world"] C --> D["When the shadow lies"] D -. "re-test" .-> A classDef first fill:#0a1424,stroke:#087A98,stroke-width:2px,color:#e6f3ff classDef step fill:#0a1424,stroke:#3f7da0,stroke-width:1px,color:#e6f3ff class A first class B,C,D step
Plans that survive a changing world
A plan is never computed against “the warehouse”. It is computed against a cut through the warehouse’s history. That cut includes the last event seen from each source, the version of every rule consulted, the identity and purpose under which context was retrieved, and the model version that generated transitions. Without those coordinates, the plan cannot be replayed or meaningfully challenged.
The time problem has two independent parts. Descriptive freshness asks how far the twin may have diverged from the live process. Entitlement freshness asks whether the actor may still perform the proposed action. A perfect state replica paired with yesterday’s permission is unsafe. A current permission paired with yesterday’s state is also unsafe. Execution requires both the world and the right to act to be current enough for that action.
Plans need provenance, not just explanations
A natural-language rationale can explain why the agent preferred Route 2. It cannot establish which reservation feed it saw, which policy version permitted the move or which transition function predicted a six-minute completion. For consequential planning, the useful explanation is partly a provenance graph: entities used, activities performed and agents responsible. W3C PROV provides a general vocabulary for representing such relationships.[7]
The proposal should therefore carry references rather than copied assertions wherever possible. A snapshot identifier points to immutable state evidence. A policy decision has its own issuer and expiry. A predicted consequence names the twin version and branch. A typed action names the authoritative API and expected postcondition. This lets an auditor remove one dependency and ask whether the plan would have changed.
Thought experiment 3The same proposal, produced by a different cause
Two systems propose moving the same four pallets to the same four slots. The first derives the plan from a twin that models capacity, temperature compatibility and carrier timing. The second ignores state and selects four slot identifiers from yesterday’s successful transfer. Their visible output is identical.
Now intervene: reserve one slot and raise the receiving temperature of another. The first system changes its proposal or abstains. The second repeats the same answer. Output agreement in the original case did not identify the mechanism. A plan earns trust when its dependencies respond to relevant interventions, not when its prose sounds situationally aware. This is why the contract records inputs and why validation must include counterfactual changes, not only replay of normal examples.
From proposal to verified outcome
Once an action passes the gate, reliability depends on transaction semantics. HTTP defines an idempotent method as one whose intended effect is the same after one or several identical requests. Many consequential business operations are expressed through non-idempotent application APIs, so the contract must supply an idempotency key and the server must remember the result associated with that key.[8] The client may then retry an unknown outcome without knowingly creating a second effect. AWS describes the same pattern through caller-provided request identifiers.[9]
Idempotency solves duplication, not truth. A server may return a success receipt before downstream state converges. A network timeout may hide a committed effect. A status field may change while the physical process fails. The end-to-end argument in system design remains relevant: only a check at the endpoint that matters can establish that the intended work was accomplished.[10] In this architecture, the executor issues an effect receipt, while a separate readback evaluates the postcondition.
Worked example 3The timeout after commit
Cedar’s authority kernel releases a reservation request with idempotency key move-2026-1842-09. The warehouse service commits slots B-17 to B-19, writes an effect receipt, then the network connection fails before the client receives it. The agent sees UNKNOWN.
An unsafe client generates a new request identifier and retries, risking a second reservation. A recoverable client asks for the status of the original key or repeats the same request with the same key. The server returns the original receipt. The readback then queries the reservation records and verifies that exactly three named slots belong to this transfer. The system records three distinct facts: execution was attempted, the service committed once, and the desired postcondition now holds.
A negative readback does not automatically mean “undo”. Physical actions may be irreversible, partially complete or owned by another process. The contract must name compensation or escalation before release. For a slot reservation, compensation may be safe cancellation. For a drug administration or funds transfer, recovery is a different workflow, not a rewind button.
Thought experiment 4Fork, reset and responsibility
The twin explores three branches: move four pallets, move three and wait, or divert all four. Branch B appears best and produces proposal p17. Before execution, the twin process crashes and restarts from the original snapshot. It now chooses Branch C. Which branch is the system responsible for?
Neither simulated branch is an operational commitment. Responsibility begins when a versioned proposal crosses into durable authority processing. If p17 was never accepted, it can disappear without changing the live lineage. If it was accepted under idempotency key k17, a twin reset cannot erase that commitment. The authority ledger, effect receipt and readback survive the planner. Many hypothetical futures may fork and vanish; the committed lineage must be singular, durable and independently reconstructable.
Executable lab: make the hidden races visible
The browser lab below implements the Cedar example with synthetic state. It compares an unsafe path, where the twin writes as though its snapshot were live, with the authority-asymmetric path. Select faults, run both paths and inspect the trace. The lab encodes four assumptions: capacity is hard, policy is checked at execution, idempotency keys are durable, and postconditions require readback.
A positive result means the gated path contains the injected fault by rejecting, deduplicating or escalating it while preserving the invariant. A negative result means the control contract is incomplete for that fault. The lab cannot establish that a real twin is accurate, that a production integration is secure or that every domain permits compensation. It exposes control logic that prose would otherwise conceal.
Operational-twin fault-injection lab
Baseline: capacity 10, twin occupancy 6, proposal reserves 4 slots. Select one or more faults.
Unsafe twin-write path
Not run- The trace will appear here.
Authority-asymmetric path
Not run- The trace will appear here.
Worked example 4A fault combination, not a happy-path demo
Select unseen live reservation, timeout after commit and client retries. The unsafe path plans from occupancy six, acts on live occupancy seven, crosses capacity when it adds four, then risks another effect because the timeout is treated as failure. The visible symptoms mix stale state, invariant breach and duplicate intent.
The gated path stops earlier. Its live precondition observes seven occupied slots and rejects the four-slot proposal, so neither timeout nor retry can arise for this action. Now clear the unseen reservation but leave timeout and retry selected. The action is allowed, committed once, returned through the same idempotency key and confirmed by readback at occupancy ten. This two-run comparison shows why controls have an order: prevention at the live boundary dominates recovery after execution, while idempotency and readback cover the cases that legitimately cross that boundary.
Read the core JavaScript and invariants
The page runs this logic locally. Change the state, add a fault or adapt the typed proposal to another reversible operation.
const invariant = state => state.occupied <= state.capacity;
function authorise(proposal, live, policy, nowMs) {
if (proposal.expiresAt < nowMs) return deny("EXPIRED");
if (!policy.allowTransfers) return deny("POLICY_DENY");
if (live.occupied + proposal.quantity > live.capacity) {
return deny("LIVE_PRECONDITION_FAILED");
}
return { allow: true };
}
function executeOnce(proposal, live, receiptStore) {
const prior = receiptStore.get(proposal.idempotencyKey);
if (prior) return prior; // safe retry
live.occupied += proposal.quantity; // authoritative effect
const receipt = { key: proposal.idempotencyKey, committed: true };
receiptStore.set(proposal.idempotencyKey, receipt);
return receipt;
}
function verify(proposal, live) {
return invariant(live) && live.occupied === proposal.expectedOccupied;
}
When the shadow lies
Every twin is wrong in at least three ways. It omits variables, estimates some values and simplifies transitions. Those imperfections are not automatically defects. A subway map is useful because it discards street geometry. The question is whether the omitted or uncertain property can reverse the decision being made.
NIST’s trust analysis for digital twins identifies temporal divergence, accuracy, functional equivalence, composability and cybersecurity among the relevant concerns. It also warns that users may treat a convincing representation as an oracle, even when the twin’s quality is conditional on purpose and operating range.[3] This paper adds an operational consequence: twin error becomes dangerous in proportion to the authority and irreversibility attached to its output.
Five ways the twin can mislead the agent
Stale state is the obvious case: the model is behind the world. Blind state is subtler: the feed is current but omits a variable such as a manual hold. Wrong transition means the current state is accurate but the simulated consequence is not, perhaps because a queue behaves differently under peak load. Wrong boundary means the twin models the warehouse but not a carrier contract that makes the route inadmissible. Compromised evidence means an attacker or faulty integration supplies plausible observations, policies or receipts.
These failures demand different tests. Faster streaming helps stale state but not blind state. More historical calibration helps transition error but not a revoked permission. Cryptographic provenance helps identify an issuer but does not prove the issuer observed reality correctly. Independent readback helps detect outcome mismatch but may arrive too late to prevent irreversible harm. A mature control design names the failure it is meant to contain.
The strongest alternative: do not use a twin
A deterministic workflow with explicit state queries is often better. If the task has one short path, stable rules, cheap live reads and no need to compare futures, a twin adds another model to validate and reconcile. A database transaction may provide stronger semantics with less machinery. The same is true when the environment cannot be modelled at the decision’s required fidelity, when safe uncertainty bounds are unavailable or when every plausible action is irreversible.
A twin also cannot repair a poorly governed system of record. If no component owns slot truth, if manual work leaves no events or if policy cannot be evaluated at execution, the shadow will inherit ambiguity. The correct first investment is operational observability and typed control, not simulation.
Boundary conditionWhere this architecture should not be applied
Do not insert an operational twin merely to make a conversational agent appear stateful. Use it when a consequential decision genuinely benefits from counterfactual rehearsal across a named state boundary. Avoid it when the action can be expressed as a direct, validated transaction; when the model cannot bound decision-relevant error; or when the additional state copy would create more ambiguity than it removes.
A testable prediction
The authority-asymmetric design yields a concrete research hypothesis. Hold planning quality constant. Give the operational-twin system current policy enforcement, live precondition checks, durable idempotency and independent readback. It should convert a larger share of injected state and permission faults into explicit rejections or recoverable unknowns than either a direct-write twin or a single agent calling tools without a versioned state model.
Open research hypothesisAsymmetry changes the failure distribution
Compare four configured systems on the same synthetic operations: a deterministic workflow, an agent with direct tools, an agent with a direct-write twin and an agent with a gated twin. Inject event lag, omitted variables, policy revocation, timeout after commit, forged receipts and transition error. Measure invariant violations, false rejections, duplicate effects, time to reconciliation and the fraction of outcomes whose cause can be reconstructed.
The hypothesis is strengthened if the gated twin reduces silent invariant violations without an unacceptable rise in false rejection or operational delay. It is weakened if the same protection is achieved more simply by direct transactions, or if twin divergence creates enough abstention to erase planning value. A rival explanation is that typed boundaries and idempotency, rather than the twin, produce most of the benefit. The experiment must therefore include a deterministic gated baseline.
stateDiagram-v2 [*] --> Claim state "Evidence status Published<br/>foundation and…" as Claim state "Thought experiment 1 The<br/>seven-minute…" as Test state "The smallest useful shadow" as Revision Claim --> Test: expose mechanism Test --> Decision: evidence survives Test --> Revision: rival survives Revision --> Claim: narrow or rebuild Decision --> [*]
Start with one reversible effect
The smallest useful implementation is not a miniature enterprise. Choose one action whose effect can be observed and, preferably, reversed. Define one authoritative system of record, one purpose, one actor class and one postcondition. Then build only enough twin state to reject an unsafe proposal.
For Cedar, that means slot reservations rather than complete pallet movement. The live system owns occupancy. The twin consumes versioned occupancy and reservation events. Its transition model answers whether a proposed reservation set remains within capacity and compatibility constraints. The agent may compare candidate sets, but it cannot reserve them. The authority kernel accepts only a ReserveSlots contract with named pallets, named slots, a short expiry, a live precondition and an idempotency key. Readback asks whether those exact slots are reserved for that exact transfer.
Run the design first in shadow mode. Let the agent and twin produce proposals while the existing workflow continues to make decisions. Compare predicted and actual transitions. Record which omitted variables would have changed admissibility. Deliberately inject stale events, policy changes and unknown outcomes. This stage establishes model usefulness and control behaviour without granting effect authority.
Next, permit automatic release only for a narrow envelope: low-value reservations, short duration, reversible cancellation and no manual hold. Keep higher-risk proposals advisory. Expansion should follow operating evidence, not a general confidence score. A new action type, broader subject set or longer validity window changes the assurance case and should be reviewed as a new capability.
This sequence also reveals the economic break point. If most proposals are rejected because the twin lacks current state, improve instrumentation. If live checks dominate latency, narrow the preconditions or place enforcement closer to the resource. If the deterministic baseline performs as well, remove the twin. If the twin consistently finds better reversible plans while the boundary contains injected faults, the architecture has earned a wider trial.
Implementation checklist and typed contract example
| Question | Evidence before release |
|---|---|
| Who owns truth? | Named authoritative API and state version |
| What may the twin omit? | Decision-sensitivity test for each omitted variable |
| How stale may state be? | Action-specific maximum snapshot age and watermark |
| What may the agent propose? | Closed set of typed actions with schemas |
| Who decides? | Current policy decision bound to actor, subject and purpose |
| How are duplicates prevented? | Server-retained idempotency key and replay semantics |
| How is outcome proved? | Independent readback of a named postcondition |
| What if certainty is impossible? | Compensation, escalation and a human-visible unknown state |
type ReserveSlotsProposal = {
proposalId: string;
twinVersion: string;
observationCut: {
warehouseVersion: string;
eventWatermark: string;
observedAt: string;
};
actor: { id: string; delegatedBy: string; purpose: "cold_chain_transfer" };
subject: { transferId: string; palletIds: string[] };
action: { kind: "ReserveSlots"; slotIds: string[] };
preconditions: { minimumFreeSlots: number; transferOpen: true };
uncertainty: { unseenReservationsMax: number };
expectedPostcondition: { reservedByTransfer: string[] };
expiresAt: string;
idempotencyKey: string;
};
sequenceDiagram participant Q as Question participant M as Mechanism participant E as Evidence participant D as Decision Q->>M: A shadow that must not become a second machine M->>E: Evidence status Published foundation and… E-->>M: compare rival explanations E->>D: Plan in the shadow and commit at the boundary D-->>Q: revise scope or act
Plan in the shadow and commit at the boundary
When a team asks whether an agent should act through a digital twin, do not begin with model fidelity or agent intelligence. Begin with the direction of authority. Can the twin change live state, directly or through inherited credentials? If yes, the architecture has created a second control plane whose errors, compromises and stale assumptions can become effects.
The better decision is to separate four questions that are often collapsed. What does the twin claim about the world? What future does the agent propose? What action is permitted now? What outcome did the authoritative process actually produce? A different component or evidential act should answer each question, even when deployment choices place them in the same platform.
Adopt an operational twin only when stateful counterfactual rehearsal changes the quality of a real decision. Keep it non-authoritative. Bind every proposal to a versioned observation cut, uncertainty envelope and expiry. Re-evaluate identity, purpose, policy and live preconditions at the resource boundary. Execute through a typed action with durable idempotency. Treat the effect receipt as evidence of processing, then verify the postcondition through an independent readback. Predefine what happens when the result is unknown.
The distinction also changes procurement and review. A demonstration that shows a twin predicting a route is evidence of planning utility, not governed execution. Ask which service owns live truth, which credential can create an effect, where permission is evaluated, how a policy change reaches enforcement, which clock determines expiry, and whether outcome verification depends on the same path that reported success. A vendor can answer each question without revealing model internals. If the answers collapse into “the agent handles it”, the control boundary is missing.
It changes incident handling as well. When an operation disagrees with the twin, do not immediately retrain the model or overwrite the live record. Preserve the observation cut, proposal, policy decision, request identifier, receipt and readback. Classify the mismatch: stale observation, omitted state, wrong transition, unauthorised effect, duplicate execution or false outcome evidence. That classification points to the responsible control. It also prevents a dangerous reconciliation pattern in which the system edits whichever record is easiest until dashboards agree.
This changes the success criterion. The goal is not a twin that never diverges. Such a promise is incoherent in a changing world. The goal is a system in which divergence becomes visible before harm, where possible; becomes bounded by reversible action, where not; and becomes reconstructable through evidence when uncertainty remains.
Human review should also attach to the uncertainty that matters, not to every proposal. A reviewer needs the live precondition that failed, the branches the twin considered, the consequence of waiting, and the exact authority being requested. They do not need a transcript of every generated token. When the action lies outside the automatic envelope, the system should offer bounded alternatives: approve a smaller reversible reservation, request a fresh observation, defer until a hold clears, or escalate to an owner who can change policy. This preserves human judgement for exceptions instead of turning oversight into a ceremonial click.[11]
For Cedar, the practical decision is modest. Do not automate pallet movement first. Automate short-lived slot reservation inside a narrow envelope. Let the agent explore many allocations in the shadow. Let the authority kernel release only a currently permitted reservation. Let the warehouse own occupancy. Let readback settle what happened. Expand only after fault injection shows that stale state, permission change, timeout and retry produce rejection or recovery rather than silent contradiction.
Plan in the shadow. Commit at the boundary. Believe the outcome only after the world answers back.
Glossary
- Authority kernel
- The deterministic control path that evaluates current permission and live preconditions before an effect.
- Effect receipt
- Evidence that an authoritative service processed or committed a named action. It is not, by itself, proof of the intended real-world outcome.
- Epistemic coupling
- The observation, synchronisation and validation relationship through which a twin forms claims about a live process.
- Idempotency key
- A caller-provided identifier that lets a service recognise retries and return the original result instead of creating a duplicate effect.
- Normative coupling
- The permission relationship through which a component may cause changes in an authoritative system.
- Observation cut
- The source versions, event watermarks and times that define what the plan could have known.
- Operational twin
- A purpose-bounded, stateful model used to rehearse decisions against a named operating process.
- Readback
- An independent query or measurement that tests whether the expected postcondition became true.
- System of record
- The component whose state is authoritative for a defined operational fact.
- Uncertainty envelope
- The set of materially plausible live states or model outcomes across which a released action must remain acceptable.
References
- Digital Twin Consortium. The definition of a digital twin. Consortium definition and characteristics.
- International Organization for Standardization. ISO 23247-1:2021, Automation systems and integration, digital twin framework for manufacturing, Part 1: overview and general principles.
- Voas, J., Mell, P., Piroumian, V., and others. NIST IR 8356: Security and Trust Considerations for Digital Twin Technology. National Institute of Standards and Technology, 2025.
- Shao, G., Hightower, J., and Schindel, W. Credibility consideration for digital twins in manufacturing. Manufacturing Letters 35, 24-28, 2023.
- Bickford, J., Van Bossuyt, D. L., Beery, P., and Pollman, A. Operationalizing digital twins through model-based systems engineering methods. Systems Engineering 23(6), 724-750, 2020.
- Rose, S., Borchert, O., Mitchell, S., and Connelly, S. NIST SP 800-207: Zero Trust Architecture. National Institute of Standards and Technology, 2020.
- Lebo, T., Sahoo, S., McGuinness, D., and others. PROV-O: The PROV Ontology. W3C Recommendation, 2013.
- Fielding, R., Nottingham, M., and Reschke, J. RFC 9110, HTTP Semantics: idempotent methods. Internet Engineering Task Force, 2022.
- Featonby, M. Making retries safe with idempotent APIs. Amazon Builders' Library.
- Saltzer, J. H., Reed, D. P., and Clark, D. D. End-to-end arguments in system design. ACM Transactions on Computer Systems 2(4), 277-288, 1984.
- Tabassi, E. Artificial Intelligence Risk Management Framework (AI RMF 1.0). National Institute of Standards and Technology, 2023.