Map shared runtime crossings to the finite proof model #972

Establish correspondence between the shared runtime's participant-crossing boundary and the concrete model for participant-crossing-dpbb-finite-v1.

Acceptance criteria

• Map API-423/RUN-319 intents, occurrences, state cuts, gate decisions, effective support, transformed subjects, history, atomic outcomes, idempotency, and replay to the model from Implement independent participant-crossing proof models #971.
• Exercise the repaired provider/effect path, v2 invocation context, and final egress outcomes through public runtime entry points. Compare observed transitions with the model; synthetic inputs alone cannot establish execution correspondence.
• Detect identity/context mismatches, stale cuts, unresolved required capabilities, partial commits, changed state after refusal, and unsupported projections of errors or timing.
• Stay within the governed finite carrier. If a revised operation cannot be mapped under its assumptions, report incompatibility; expanding the carrier or hiding additional behavior requires a separate governed profile decision.
• Publish differential checks, the state/transition mapping, artifact digests, and drift detection. Keep mapping evidence separate from a bisimulation decision, concrete backend conformance, and whole-runtime claims.

Prerequisites: #971, #1369, #1357, #1358.

References: Runtime diagnosis, SEM-232.