libpetri 2.10.5 → 2.11.0

package/dist/{chunk-M3KT7BFO.js → chunk-YKJQ7IKZ.js}

@@ -1925,7 +1925,7 @@ function encodeViolation(ctx, plan, lay, flat, property, cur) {
 }
 
 // src/verification/analysis/name-fragment.ts
-function classify(net) {
+function classify(net, mode, carrierPlaces) {
   const coloured = /* @__PURE__ */ new Set();
   let anyMatch = false;
   for (const t of net.transitions) {
@@ -1935,9 +1935,18 @@ function classify(net) {
     }
   }
   if (!anyMatch || coloured.size === 0) return null;
+  if (mode === "extended") {
+    for (const c of carrierPlaces) coloured.add(c);
+  }
+  for (const t of net.transitions) {
+    if (t.resets.some((r) => coloured.has(r.place.name)) || t.reads.some((r) => coloured.has(r.place.name)) || t.inhibitors.some((i) => coloured.has(i.place.name))) {
+      return null;
+    }
+  }
   const roles = /* @__PURE__ */ new Map();
   for (const t of net.transitions) {
-    const consumesColoured = t.inputSpecs.some((s) => coloured.has(s.place.name));
+    const colouredInputs = t.inputSpecs.filter((s) => coloured.has(s.place.name));
+    const consumesColoured = colouredInputs.length > 0;
     let producesColoured = false;
     if (t.outputSpec !== null) {
       for (const branch of enumerateBranches(t.outputSpec)) {
@@ -1958,11 +1967,16 @@ function classify(net) {
       }
       colouredIn.sort((a, b) => a[0] < b[0] ? -1 : a[0] > b[0] ? 1 : 0);
       role = { type: "join", colouredIn };
+    } else if (consumesColoured) {
+      if (mode === "base") return null;
+      if (colouredInputs.length !== 1) return null;
+      const spec = colouredInputs[0];
+      const countOne = spec.type === "one" || spec.type === "exactly" && spec.count === 1;
+      if (!countOne) return null;
+      role = { type: "consume", colouredInput: spec.place.name };
     } else if (producesColoured) {
-      if (consumesColoured) return null;
       role = { type: "mint" };
     } else {
-      if (consumesColoured) return null;
       role = { type: "ordinary" };
     }
     roles.set(t.name, role);
@@ -2165,12 +2179,15 @@ var NameStateClassGraph = class _NameStateClassGraph {
     this._successors[from].push(to);
   }
 };
+function colouredOutputs(outputPlaces, fragment) {
+  return [...outputPlaces].filter((p) => fragment.isColoured(p.name)).map((p) => p.name);
+}
 function nameSuccessors(role, names, outputPlaces, fragment, sym) {
   switch (role.type) {
     case "ordinary":
       return [names.copy()];
     case "mint": {
-      const colouredOut = [...outputPlaces].filter((p) => fragment.isColoured(p.name)).map((p) => p.name);
+      const colouredOut = colouredOutputs(outputPlaces, fragment);
       const nm = names.copy();
       if (colouredOut.length > 0) {
         const fresh = sym.next++;
@@ -2187,6 +2204,17 @@ function nameSuccessors(role, names, outputPlaces, fragment, sym) {
       }
       return result;
     }
+    case "consume": {
+      const colouredOut = colouredOutputs(outputPlaces, fragment);
+      const result = [];
+      for (const s of names.symbolsIn(role.colouredInput)) {
+        const nm = names.copy();
+        nm.remove(role.colouredInput, s, 1);
+        for (const p of colouredOut) nm.add(p, s, 1);
+        result.push(nm);
+      }
+      return result;
+    }
   }
 }
 function enablingSymbols(names, colouredIn) {
@@ -2210,8 +2238,8 @@ function enablingSymbols(names, colouredIn) {
 
 // src/verification/nu-scg-verifier.ts
 var NOTE_EXACT = "\nNote: \u03BD-join correlation decided exactly via the state-class-graph name-partition quotient \u2014 the symbolic graph closed, so the verdict is sound AND complete (no spurious different-name counterexample; quiescence is name-aware), beyond the bounded-budget fragment (NU-050, Route B).\n";
-function verifyViaNameScg(net, initial, property, sinkPlaces, environmentPlaces, environmentMode, maxClasses) {
-  const fragment = classify(net);
+function verifyViaNameScg(net, initial, property, sinkPlaces, environmentPlaces, environmentMode, maxClasses, fragmentMode, carrierPlaces) {
+  const fragment = classify(net, fragmentMode, carrierPlaces);
   if (fragment === null) return null;
   for (const p of initial.placesWithTokens()) {
     if (fragment.isColoured(p.name)) return null;
@@ -2322,6 +2350,8 @@ var SmtVerifier = class _SmtVerifier {
   _environmentMode = alwaysAvailable();
   _timeoutMs = 6e4;
   _nuMaxClasses = 1e5;
+  _fragmentMode = "base";
+  _carrierPlaces = /* @__PURE__ */ new Set();
   static forNet(net) {
     return new _SmtVerifier(net);
   }
@@ -2381,6 +2411,38 @@ var SmtVerifier = class _SmtVerifier {
     this._nuMaxClasses = max;
     return this;
   }
+  /**
+   * Selects the ν-net coloured-place fragment for Route B (NU-051). `base`
+   * (default) admits the shipped mint → matched-join fragment only; `extended`
+   * additionally admits the opt-in coloured-consumer (drain/relay) role and the
+   * declared {@link carrierPlaces}. When `extended` is requested but the net
+   * falls outside the coloured-consumer fragment, Route B declines and a short
+   * note is appended to the report before falling back to the sound
+   * over-approximation.
+   */
+  fragmentMode(mode) {
+    this._fragmentMode = mode;
+    return this;
+  }
+  /**
+   * Declares ν-net *carrier* places (NU-051, EXTENDED only): intermediate places
+   * that carry a fresh name from the minting fork onward to a ν-join input. Under
+   * {@link fragmentMode} `extended` they are unioned into the coloured set so the
+   * existing mint co-mints one fresh name into all of them; under `base` they are
+   * ignored. Accumulating. Throws if a declared place is not in the net — a
+   * mistyped carrier name would let two fork branches mint independent names, so
+   * the join never becomes name-enabled and the verifier would otherwise report a
+   * confident false deadlock; it must surface, never silently proceed.
+   */
+  carrierPlaces(...places) {
+    for (const p of places) {
+      if (![...this.net.places].some((np) => np.name === p.name)) {
+        throw new Error(`declared carrier place '${p.name}' not in the net`);
+      }
+      this._carrierPlaces.add(p.name);
+    }
+    return this;
+  }
   /**
    * Runs the verification pipeline.
    */
@@ -2403,7 +2465,9 @@ var SmtVerifier = class _SmtVerifier {
         this._sinkPlaces,
         this._environmentPlaces,
         this._environmentMode,
-        this._nuMaxClasses
+        this._nuMaxClasses,
+        this._fragmentMode,
+        this._carrierPlaces
       );
       if (outcome !== null) {
         report.push("=== \u03BD-net Route B: name-aware state-class graph (NU-050) ===");
@@ -2428,6 +2492,11 @@ var SmtVerifier = class _SmtVerifier {
           }
         );
       }
+      if (this._fragmentMode === "extended") {
+        report.push(
+          "\u03BD-net Route B (EXTENDED) declined: net outside coloured-consumer fragment (a coloured place consumed count != 1 or by multiple inputs, carries a reset/read/inhibitor arc, or a join re-mints a coloured place); verified via sound over-approximation instead."
+        );
+      }
     }
     report.push("Phase 1: Flattening net...");
     const flatNet = flatten(this.net, this._environmentPlaces, this._environmentMode);
@@ -2770,4 +2839,4 @@ export {
   isProven,
   isViolated
 };
-//# sourceMappingURL=chunk-M3KT7BFO.js.map
+//# sourceMappingURL=chunk-YKJQ7IKZ.js.map