libpetri 2.13.0 → 3.0.0

package/dist/{chunk-JVI5HFRX.js → chunk-VCDOKWVU.js}

@@ -1,6 +1,6 @@
 import {
   matchCorrelates
-} from "./chunk-E3ZWB645.js";
+} from "./chunk-YVIPJ6KM.js";
 import {
   earliest,
   hasDeadline,
@@ -714,4 +714,4 @@ export {
   renderDot,
   dotExport
 };
-//# sourceMappingURL=chunk-JVI5HFRX.js.map
+//# sourceMappingURL=chunk-VCDOKWVU.js.map

package/dist/{chunk-E3ZWB645.js → chunk-YVIPJ6KM.js}

@@ -24,4 +24,4 @@ export {
   keyForPlace,
   matchCorrelates
 };
-//# sourceMappingURL=chunk-E3ZWB645.js.map
+//# sourceMappingURL=chunk-YVIPJ6KM.js.map

package/dist/chunk-YVIPJ6KM.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core/match-spec.ts"],"sourcesContent":["/**\n * ν-net join correlation ([[MatchSpec]]).\n *\n * A {@link MatchSpec} declares that a subset of a transition's **input** places\n * must be correlated by **name equality**: the transition is enabled only when\n * there exists a single {@link NameId} `n` such that every correlated input\n * supplies (at least) its required token count whose projected name equals `n`.\n * On firing, exactly those name-matched tokens are consumed (spec NU-020).\n *\n * This is the single *decidable* predicate — equality of opaque names — and is\n * deliberately NOT a general input predicate: it correlates the name dimension\n * *across* places (composition-structural, like cardinality) rather than\n * evaluating an arbitrary boolean per token. Input specifications themselves\n * remain purely structural (IO-006); name correlation is the only per-token\n * filter the enablement check ever applies (NU-021).\n */\nimport type { Place } from './place.js';\nimport type { NameId } from './name.js';\n\n/**\n * A name projection: maps a token's value to its {@link NameId}. A projection\n * that yields no name (returns `null`/`undefined` at runtime) is treated as\n * \"no name\" — that token never correlates — mirroring the Java/Rust `KeyFn`\n * contract; the binding selector handles a nullish result defensively.\n */\nexport type KeyFn<T = any> = (value: T) => NameId;\n\n/** One correlated input: the place plus its name projection. */\nexport interface MatchKey<T = any> {\n  readonly place: Place<T>;\n  readonly key: KeyFn<T>;\n}\n\n/** Correlated fork/join match specification (ν-net join side). */\nexport interface MatchSpec {\n  readonly keys: readonly MatchKey[];\n}\n\n/** Builds one correlated input for a {@link MatchSpec}. */\nexport function matchKey<T>(place: Place<T>, key: KeyFn<T>): MatchKey<T> {\n  return { place, key };\n}\n\n/**\n * Builds a {@link MatchSpec} from two or more correlated inputs.\n *\n * @example\n *   Transition.builder('join')\n *     .inputs(one(branchA), one(branchB))\n *     .match(matchSpec(\n *       matchKey(branchA, (m: Msg) => nameId(m.correlationId)),\n *       matchKey(branchB, (m: Msg) => nameId(m.correlationId)),\n *     ))\n *\n * @throws if fewer than two inputs are correlated (a match over a single place\n *   correlates nothing).\n */\nexport function matchSpec(...keys: MatchKey[]): MatchSpec {\n  if (keys.length < 2) {\n    throw new Error(`MatchSpec must correlate at least 2 input places, got ${keys.length}`);\n  }\n  return { keys };\n}\n\n/** Returns the name projection for `placeName`, or `undefined` if not correlated. */\nexport function keyForPlace(spec: MatchSpec, placeName: string): KeyFn | undefined {\n  for (const k of spec.keys) {\n    if (k.place.name === placeName) return k.key;\n  }\n  return undefined;\n}\n\n/** True when `placeName` is one of the correlated inputs. */\nexport function matchCorrelates(spec: MatchSpec, placeName: string): boolean {\n  return spec.keys.some(k => k.place.name === placeName);\n}\n"],"mappings":";AAuCO,SAAS,SAAY,OAAiB,KAA4B;AACvE,SAAO,EAAE,OAAO,IAAI;AACtB;AAgBO,SAAS,aAAa,MAA6B;AACxD,MAAI,KAAK,SAAS,GAAG;AACnB,UAAM,IAAI,MAAM,yDAAyD,KAAK,MAAM,EAAE;AAAA,EACxF;AACA,SAAO,EAAE,KAAK;AAChB;AAGO,SAAS,YAAY,MAAiB,WAAsC;AACjF,aAAW,KAAK,KAAK,MAAM;AACzB,QAAI,EAAE,MAAM,SAAS,UAAW,QAAO,EAAE;AAAA,EAC3C;AACA,SAAO;AACT;AAGO,SAAS,gBAAgB,MAAiB,WAA4B;AAC3E,SAAO,KAAK,KAAK,KAAK,OAAK,EAAE,MAAM,SAAS,SAAS;AACvD;","names":[]}

package/dist/debug/index.d.ts

@@ -1,6 +1,6 @@
 import { Writable } from 'node:stream';
-import { P as PetriNet, b as Transition, T as Token } from '../petri-net-C3LSY-vm.js';
-import { E as EventStore, N as NetEvent } from '../event-store-DKTenPbC.js';
+import { P as PetriNet, b as Transition, T as Token } from '../petri-net-UQBBkvLl.js';
+import { E as EventStore, N as NetEvent } from '../event-store-Df_sAVQ_.js';
 
 /**
  * Commands sent from debug UI client to server via WebSocket.

package/dist/debug/index.js

@@ -6,8 +6,8 @@ import {
   instancePrefixOf,
   parentOf,
   sanitize
-} from "../chunk-JVI5HFRX.js";
-import "../chunk-E3ZWB645.js";
+} from "../chunk-VCDOKWVU.js";
+import "../chunk-YVIPJ6KM.js";
 import "../chunk-ATT7U5H5.js";
 
 // src/debug/debug-command.ts

package/dist/doclet/index.d.ts

@@ -1,5 +1,5 @@
 import { Application } from 'typedoc';
-import { P as PetriNet, S as SubnetDef, o as Instance } from '../petri-net-C3LSY-vm.js';
+import { P as PetriNet, S as SubnetDef, o as Instance } from '../petri-net-UQBBkvLl.js';
 
 /**
  * TypeDoc plugin for `@petrinet` and `@subnet` tags — auto-generates

package/dist/doclet/index.js

@@ -3,8 +3,8 @@ import {
   dotExport,
   nodeStyle,
   sanitize
-} from "../chunk-JVI5HFRX.js";
-import "../chunk-E3ZWB645.js";
+} from "../chunk-VCDOKWVU.js";
+import "../chunk-YVIPJ6KM.js";
 import "../chunk-ATT7U5H5.js";
 
 // src/doclet/petri-net-plugin.ts
@@ -447,7 +447,7 @@ function escapeLabel(s) {
 
 // src/doclet/petri-net-plugin.ts
 async function getDotExport() {
-  const mod = await import("../dot-exporter-SHBYMMJ3.js");
+  const mod = await import("../dot-exporter-3STXYK74.js");
   return mod.dotExport;
 }
 var TAG_PETRINET = "@petrinet";

package/dist/dot-exporter-3STXYK74.js

@@ -0,0 +1,9 @@
+import {
+  dotExport
+} from "./chunk-VCDOKWVU.js";
+import "./chunk-YVIPJ6KM.js";
+import "./chunk-ATT7U5H5.js";
+export {
+  dotExport
+};
+//# sourceMappingURL=dot-exporter-3STXYK74.js.map

package/dist/{event-store-DKTenPbC.d.ts → event-store-Df_sAVQ_.d.ts}

@@ -1,4 +1,4 @@
-import { T as Token } from './petri-net-C3LSY-vm.js';
+import { T as Token } from './petri-net-UQBBkvLl.js';
 
 /**
  * Events emitted during Petri Net execution.

package/dist/export/index.d.ts

@@ -1,4 +1,4 @@
-import { P as PetriNet } from '../petri-net-C3LSY-vm.js';
+import { P as PetriNet } from '../petri-net-UQBBkvLl.js';
 
 /**
  * Format-agnostic typed graph model.

package/dist/export/index.js

@@ -8,8 +8,8 @@ import {
   nodeStyle,
   renderDot,
   sanitize
-} from "../chunk-JVI5HFRX.js";
-import "../chunk-E3ZWB645.js";
+} from "../chunk-VCDOKWVU.js";
+import "../chunk-YVIPJ6KM.js";
 import "../chunk-ATT7U5H5.js";
 export {
   DEFAULT_DOT_CONFIG,

package/dist/index.d.ts

@@ -1,7 +1,7 @@
-import { P as PetriNet, S as SubnetDef, a as Place, T as Token, b as Transition, E as EnvironmentPlace, c as TransitionContext, O as Out } from './petri-net-C3LSY-vm.js';
-export { A as Arc, d as ArcInhibitor, e as ArcInput, f as ArcOutput, g as ArcRead, h as ArcReset, C as Channel, i as ComposeBindings, F as FusionSet, j as FusionSetBuilder, I as In, k as InAll, l as InAtLeast, m as InExactly, n as InOne, o as Instance, p as Interface, q as InterfaceBuilder, K as KeyFn, L as LogFn, M as MAX_DURATION_MS, r as MatchKey, s as MatchSpec, N as NameId, t as OutAnd, u as OutForwardInput, v as OutPlace, w as OutTimeout, x as OutXor, y as OutputEntry, z as PetriNetBuilder, B as Port, D as PortDirection, G as SubnetDefBuilder, H as SubnetInstance, J as Timing, Q as TimingDeadline, R as TimingDelayed, U as TimingExact, V as TimingImmediate, W as TimingWindow, X as TokenInput, Y as TokenOutput, Z as TransitionAction, _ as TransitionBuilder, $ as VerificationHarness, a0 as VerificationResult, a1 as all, a2 as allPlaces, a3 as and, a4 as andPlaces, a5 as arcPlace, a6 as atLeast, a7 as consumptionCount, a8 as deadline, a9 as delayed, aa as earliest, ab as enumerateBranches, ac as environmentPlace, ad as exact, ae as exactly, af as fork, ag as forwardInput, ah as hasDeadline, ai as hasGuard, aj as immediate, ak as inhibitorArc, al as inputArc, am as isPassthrough, an as isUnit, ao as keyForPlace, ap as latest, aq as matchCorrelates, ar as matchKey, as as matchSpec, at as matchesGuard, au as nameId, av as one, aw as outPlace, ax as outputArc, ay as passthrough, az as place, aA as produce, aB as readArc, aC as requiredCount, aD as resetArc, aE as timeout, aF as timeoutPlace, aG as tokenAt, aH as tokenOf, aI as transform, aJ as transformAsync, aK as transformFrom, aL as unitToken, aM as window, aN as withTimeout, aO as xor, aP as xorPlaces } from './petri-net-C3LSY-vm.js';
-import { E as EventStore } from './event-store-DKTenPbC.js';
-export { A as ActionTimedOut, a as ExecutionCompleted, b as ExecutionStarted, I as InMemoryEventStore, L as LogMessage, M as MarkingSnapshot, N as NetEvent, T as TokenAdded, c as TokenRemoved, d as TransitionClockRestarted, e as TransitionCompleted, f as TransitionEnabled, g as TransitionFailed, h as TransitionStarted, i as TransitionTimedOut, j as eventTransitionName, k as eventsOfType, l as failures, m as filterEvents, n as inMemoryEventStore, o as isFailureEvent, p as noopEventStore, t as transitionEvents } from './event-store-DKTenPbC.js';
+import { P as PetriNet, S as SubnetDef, a as Place, T as Token, b as Transition, E as EnvironmentPlace, c as TransitionContext, O as Out } from './petri-net-UQBBkvLl.js';
+export { A as Arc, d as ArcInhibitor, e as ArcInput, f as ArcOutput, g as ArcRead, h as ArcReset, C as Channel, i as ComposeBindings, F as FusionSet, j as FusionSetBuilder, I as In, k as InAll, l as InAtLeast, m as InExactly, n as InOne, o as Instance, p as Interface, q as InterfaceBuilder, K as KeyFn, L as LogFn, M as MAX_DURATION_MS, r as MatchKey, s as MatchSpec, N as NameId, t as OutAnd, u as OutForwardInput, v as OutPlace, w as OutTimeout, x as OutXor, y as OutputEntry, z as PetriNetBuilder, B as Port, D as PortDirection, G as SubnetDefBuilder, H as SubnetInstance, J as Timing, Q as TimingDeadline, R as TimingDelayed, U as TimingExact, V as TimingImmediate, W as TimingWindow, X as TokenInput, Y as TokenOutput, Z as TransitionAction, _ as TransitionBuilder, $ as VerificationHarness, a0 as VerificationResult, a1 as all, a2 as allPlaces, a3 as and, a4 as andPlaces, a5 as arcPlace, a6 as atLeast, a7 as consumptionCount, a8 as deadline, a9 as delayed, aa as earliest, ab as enumerateBranches, ac as environmentPlace, ad as exact, ae as exactly, af as fork, ag as forwardInput, ah as hasDeadline, ai as immediate, aj as inhibitorArc, ak as inputArc, al as isPassthrough, am as isUnit, an as keyForPlace, ao as latest, ap as matchCorrelates, aq as matchKey, ar as matchSpec, as as nameId, at as one, au as outPlace, av as outputArc, aw as passthrough, ax as place, ay as produce, az as readArc, aA as requiredCount, aB as resetArc, aC as timeout, aD as timeoutPlace, aE as tokenAt, aF as tokenOf, aG as transform, aH as transformAsync, aI as transformFrom, aJ as unitToken, aK as window, aL as withTimeout, aM as xor, aN as xorPlaces } from './petri-net-UQBBkvLl.js';
+import { E as EventStore } from './event-store-Df_sAVQ_.js';
+export { A as ActionTimedOut, a as ExecutionCompleted, b as ExecutionStarted, I as InMemoryEventStore, L as LogMessage, M as MarkingSnapshot, N as NetEvent, T as TokenAdded, c as TokenRemoved, d as TransitionClockRestarted, e as TransitionCompleted, f as TransitionEnabled, g as TransitionFailed, h as TransitionStarted, i as TransitionTimedOut, j as eventTransitionName, k as eventsOfType, l as failures, m as filterEvents, n as inMemoryEventStore, o as isFailureEvent, p as noopEventStore, t as transitionEvents } from './event-store-Df_sAVQ_.js';
 
 /**
  * Discriminated sum-type abstraction over Petri nets, distinguishing **closed**
@@ -51,10 +51,17 @@ declare function openSubnet(def: SubnetDef<unknown>): Subnet;
  * due to cache locality. Only optimize if profiling shows a bottleneck.
  */
 
-/** Anything that carries a place reference and an optional guard predicate. */
-interface GuardSpec<T = any> {
+/**
+ * A place reference plus an optional per-token predicate.
+ *
+ * Used by the ν-net join path (NU-020/NU-021) to select the tokens whose
+ * projected correlation name equals the chosen binding. This is *not* an input
+ * guard (IO-006, removed) — input specifications are purely structural; the
+ * predicate here is always derived from name correlation.
+ */
+interface PredicateSpec<T = any> {
     readonly place: Place<T>;
-    readonly guard?: (value: T) => boolean;
+    readonly predicate?: (value: T) => boolean;
 }
 /**
  * Mutable marking (token state) of a Petri Net during execution.
@@ -75,23 +82,23 @@ declare class Marking {
     /** Removes and returns all tokens from a place. */
     removeAll<T>(place: Place<T>): Token<T>[];
     /**
-     * Removes and returns the first token whose value satisfies the guard predicate.
+     * Removes and returns the first token whose value satisfies the predicate.
      *
-     * Performs a linear scan of the place's FIFO queue. If no guard is provided,
-     * behaves like `removeFirst()`. If a guard is provided, skips non-matching
+     * Performs a linear scan of the place's FIFO queue. If no predicate is
+     * provided, behaves like `removeFirst()`. Otherwise skips non-matching
      * tokens and splices the first match out of the queue (O(n) worst case).
      */
-    removeFirstMatching(spec: GuardSpec): Token<any> | null;
-    /** Check if any token matches a guard predicate. */
-    hasMatchingToken(spec: GuardSpec): boolean;
+    removeFirstMatching(spec: PredicateSpec): Token<any> | null;
+    /** Check if any token satisfies the predicate. */
+    hasMatchingToken(spec: PredicateSpec): boolean;
     /**
-     * Counts tokens in a place whose values satisfy the guard predicate.
+     * Counts tokens in a place whose values satisfy the predicate.
      *
-     * If no guard is provided, returns the total token count (O(1)).
-     * With a guard, performs a linear scan over all tokens (O(n)).
-     * Used by the executor for enablement checks on guarded `all`/`at-least` inputs.
+     * If no predicate is provided, returns the total token count (O(1)).
+     * With a predicate, performs a linear scan over all tokens (O(n)).
+     * Used by the executor to size a ν-net correlated `all`/`at-least` consume.
      */
-    countMatching(spec: GuardSpec): number;
+    countMatching(spec: PredicateSpec): number;
     /**
      * Returns tokens in a place. **Returns a live reference** to the internal
      * array — callers must not mutate it. Copy with `[...peekTokens(p)]` if
@@ -147,18 +154,22 @@ declare class CompiledNet {
     private readonly _placeToTransitions;
     private readonly _consumptionPlaceIds;
     private readonly _cardinalityChecks;
-    private readonly _hasGuards;
     private readonly _hasMatch;
     private constructor();
     static compile(net: PetriNet): CompiledNet;
     place(pid: number): Place<any>;
     transition(tid: number): Transition;
     placeId(place: Place<any>): number;
+    /**
+     * Non-throwing variant of {@link placeId}: `undefined` when the compiled net
+     * does not know the place. Lets callers retain tokens on undeclared places
+     * (CORE-072) instead of rejecting or dropping them.
+     */
+    tryPlaceId(place: Place<any>): number | undefined;
     transitionId(t: Transition): number;
     affectedTransitions(pid: number): readonly number[];
     consumptionPlaceIds(tid: number): readonly number[];
     cardinalityCheck(tid: number): CardinalityCheck | null;
-    hasGuards(tid: number): boolean;
     hasMatch(tid: number): boolean;
     /**
      * Two-phase bitmap enablement check for a transition:
@@ -167,8 +178,9 @@ declare class CompiledNet {
      * 2. **Inhibitor check**: verifies no inhibitor places have tokens
      *    via `!intersects(snapshot, inhibitorMask)`.
      *
-     * This is a necessary but not sufficient condition — cardinality and guard checks
-     * are performed separately by the executor for transitions that pass this fast path.
+     * This is a necessary but not sufficient condition — cardinality and ν-net match
+     * checks are performed separately by the executor for transitions that pass this
+     * fast path.
      */
     canEnableBitmap(tid: number, markingSnapshot: Uint32Array): boolean;
 }
@@ -273,7 +285,7 @@ declare class BitmapNetExecutor implements PetriNetExecutor {
     private readonly allImmediate;
     private readonly allSamePriority;
     private readonly eventStoreEnabled;
-    private readonly markedPlaces;
+    private readonly markingBitmap;
     private readonly dirtySet;
     private readonly markingSnapBuffer;
     private readonly dirtySnapBuffer;
@@ -296,6 +308,11 @@ declare class BitmapNetExecutor implements PetriNetExecutor {
     private wakeUpResolve;
     private readonly readyBuffer;
     private readonly pendingResetPlaces;
+    /**
+     * Undeclared place names already reported (CORE-072 AC4). Keyed by name — TS
+     * Place identity is name-based — so a hot loop warns once, not per token.
+     */
+    private readonly warnedUnknownPlaces;
     private readonly transitionInputPlaceNames;
     private running;
     private draining;
@@ -315,7 +332,7 @@ declare class BitmapNetExecutor implements PetriNetExecutor {
     inject<T>(envPlace: EnvironmentPlace<T>, token: Token<T>): Promise<boolean>;
     /** Convenience: inject a raw value (creates token with current timestamp). */
     injectValue<T>(envPlace: EnvironmentPlace<T>, value: T): Promise<boolean>;
-    private initializeMarkedBitmap;
+    private initializeMarkingBitmap;
     private markAllDirty;
     private shouldTerminate;
     private updateDirtyTransitions;
@@ -337,7 +354,7 @@ declare class BitmapNetExecutor implements PetriNetExecutor {
      * Fast path for nets where all transitions are immediate and same priority.
      * Skips timing checks, sorting, and snapshot buffer — just scan and fire.
      *
-     * Uses live `markedPlaces` instead of a snapshot. Safe because
+     * Uses live `markingBitmap` instead of a snapshot. Safe because
      * `updateBitmapAfterConsumption()` synchronously updates the bitmap before the next
      * iteration. For equal-priority immediate transitions, tid scan order satisfies
      * FIFO-by-enablement-time (all enabled in the same cycle).
@@ -352,7 +369,7 @@ declare class BitmapNetExecutor implements PetriNetExecutor {
      * EventStore.append on a token-removed or transition-started emit, or an error thrown while
      * consuming the matched tokens — unwinds out of the orchestrator loop and kills the executor.
      * The transition is instead failed and marked dirty for re-evaluation, the same treatment an
-     * asynchronously-reported failure gets. Enablement-phase throws (a guard or key function that
+     * asynchronously-reported failure gets. Enablement-phase throws (a key function that
      * throws inside canEnable, before the firing) run outside this boundary and are not contained
      * here.
      *
@@ -395,6 +412,12 @@ declare class BitmapNetExecutor implements PetriNetExecutor {
     executionId(): string;
     drain(): void;
     close(): void;
+    /**
+     * Reports an undeclared place once (CORE-072 AC4, emitted as the EVT-013
+     * log-message event). `transitionName` is the producer, empty at the
+     * initial-marking and injection seams. Retention never depends on this.
+     */
+    private warnUnknownPlace;
     private emitEvent;
 }
 
@@ -434,6 +457,12 @@ declare class PrecompiledNet {
     readonly places: readonly Place<any>[];
     /** Per-transition consume opcode sequences. */
     readonly consumeOps: readonly (readonly number[])[];
+    /**
+     * Per-transition index into {@link consumeOps} where the RESET tail begins; the
+     * executor peeks read arcs at this boundary so reads observe the post-input,
+     * pre-reset marking (EXEC-013 AC4).
+     */
+    readonly resetOpsStart: Uint32Array;
     /** Per-transition read-arc place IDs. */
     readonly readOps: readonly (readonly number[])[];
     readonly needsMask: readonly Uint32Array[];
@@ -466,7 +495,6 @@ declare class PrecompiledNet {
     readonly placeToTransitions: readonly (readonly number[])[];
     readonly consumptionPlaceIds: readonly (readonly number[])[];
     readonly cardinalityChecks: readonly (CardinalityCheck | null)[];
-    readonly hasGuards: readonly boolean[];
     readonly hasMatch: readonly boolean[];
     readonly allImmediate: boolean;
     readonly allSamePriority: boolean;
@@ -544,6 +572,14 @@ declare class PrecompiledNetExecutor implements PetriNetExecutor {
     private readonly eventStoreEnabled;
     /** Per-place token arrays, indexed by pid. */
     private readonly tokenQueues;
+    /**
+     * Tokens on places the compiled net does not know (CORE-072 AC3). Retained —
+     * never dropped — and merged into the materialized marking, matching the
+     * BitmapNetExecutor reference, whose Marking keeps them naturally. Keyed by
+     * place NAME (TS Place identity is name-based), carrying the Place so
+     * materializing a Marking has one to hand.
+     */
+    private readonly unknownPlaceTokens;
     /** Monotonic source for ν-name minting (ctx.freshName(), NU-010). */
     private freshNameCounter;
     /**
@@ -638,7 +674,7 @@ declare class PrecompiledNetExecutor implements PetriNetExecutor {
      * EventStore.append on a token-removed or transition-started emit, or an error thrown while
      * consuming the matched tokens — unwinds out of the orchestrator loop and kills the executor.
      * The transition is instead failed and marked dirty for re-evaluation, the same treatment an
-     * asynchronously-reported failure gets. Enablement-phase throws (a guard or key function that
+     * asynchronously-reported failure gets. Enablement-phase throws (a key function that
      * throws inside canEnable, before the firing) run outside this boundary and are not contained
      * here.
      *
@@ -646,24 +682,39 @@ declare class PrecompiledNetExecutor implements PetriNetExecutor {
      * so a throw inside that window would leave bits asserting tokens that are gone; the
      * recovery re-runs updateBitmapAfterConsumption against the true queue lengths.
      *
-     * Named to avoid colliding with the pre-existing {@link fireTransitionGuarded}
-     * guard-consume helper. Unlike the Java runtime there is no VirtualMachineError/
-     * LinkageError analogue on the JS side, so every throw is contained here — there is
-     * deliberately no fatal-rethrow escape hatch.
+     * Unlike the Java runtime there is no VirtualMachineError/LinkageError analogue on
+     * the JS side, so every throw is contained here — there is deliberately no
+     * fatal-rethrow escape hatch.
      */
     private fireTransitionContained;
     private fireTransition;
     /**
      * Consumes the name-matched tokens for a ν-net join (NU-020): correlated
-     * inputs take tokens whose projected name equals the chosen binding (guard
-     * first, then name equality — NU-021); other inputs consume FIFO. Reset arcs
-     * are honoured as on the opcode path. Mirrors {@link fireTransitionGuarded}.
+     * inputs take tokens whose projected name equals the chosen binding (NU-021);
+     * other inputs consume FIFO. Reset arcs are honoured as on the opcode path.
      */
     private fireTransitionMatched;
-    private fireTransitionGuarded;
+    /**
+     * Peeks each read-arc place's front token into the context inputs. Called at
+     * the input/reset boundary of a firing (EXEC-013): after input consumption,
+     * before reset draining — so read(p)+reset(p) observes the pre-reset token.
+     */
+    private peekReadArcs;
     private updateBitmapAfterConsumption;
     private processCompletedTransitions;
     private processExternalEvents;
+    /**
+     * Adds a produced or injected token: queue/bitmap/dirty for compiled places,
+     * or the retention side map when the program does not know it (CORE-072 AC3).
+     * `transitionName` is the producer, empty at the injection seam.
+     */
+    private produceToken;
+    /**
+     * Retains a token on an undeclared place (CORE-072 AC3) and reports the place
+     * once — the first insert is the only one that creates a map entry, so a hot
+     * loop cannot flood (AC4, emitted as the EVT-013 log-message event).
+     */
+    private retainUnknownToken;
     private drainPendingExternalEvents;
     private awaitWork;
     private millisUntilNextTimedTransition;
@@ -716,7 +767,9 @@ declare function validateOutSpec(tName: string, spec: Out, producedPlaceNames: S
  * exceeds its timeout. Walks the Out spec tree recursively:
  *
  * - **Place**: produces `null` (the timeout sentinel value).
- * - **ForwardInput**: forwards the consumed input token to the output place.
+ * - **ForwardInput**: forwards *all* tokens consumed from the `from` place to the
+ *   output place, in consumption order — one output token per consumed token, so a
+ *   batched input spec (`all()` / `exactly(n)`) conserves its tokens on timeout.
  * - **AND**: recurses into all children (all branches get tokens).
  * - **XOR**: disallowed — timeout cannot choose a branch non-deterministically.
  * - **Timeout**: disallowed — nested timeouts would create ambiguous recovery paths.
@@ -727,4 +780,4 @@ declare function validateOutSpec(tName: string, spec: Out, producedPlaceNames: S
  */
 declare function produceTimeoutOutput(context: TransitionContext, timeoutChild: Out): void;
 
-export { BitmapNetExecutor, type BitmapNetExecutorOptions, type CardinalityCheck, CompiledNet, EnvironmentPlace, EventStore, type GuardSpec, Marking, Out, OutViolationError, PetriNet, type PetriNetExecutor, Place, PrecompiledNet, PrecompiledNetExecutor, type PrecompiledNetExecutorOptions, type Subnet, SubnetDef, Token, Transition, TransitionContext, clearBit, closedSubnet, containsAll, intersects, openSubnet, produceTimeoutOutput, setBit, testBit, validateOutSpec };
+export { BitmapNetExecutor, type BitmapNetExecutorOptions, type CardinalityCheck, CompiledNet, EnvironmentPlace, EventStore, Marking, Out, OutViolationError, PetriNet, type PetriNetExecutor, Place, PrecompiledNet, PrecompiledNetExecutor, type PrecompiledNetExecutorOptions, type PredicateSpec, type Subnet, SubnetDef, Token, Transition, TransitionContext, clearBit, closedSubnet, containsAll, intersects, openSubnet, produceTimeoutOutput, setBit, testBit, validateOutSpec };