libpetri 1.8.5 → 2.1.0

package/dist/chunk-RNWTYK5B.js

@@ -0,0 +1,419 @@
+// src/viewer/layout/preprocess.ts
+function classifyKind(id) {
+  if (id.startsWith("p_")) return "place";
+  if (id.startsWith("t_")) return "transition";
+  return "junction";
+}
+function parseAttrs(body) {
+  const attrs = {};
+  for (const m of body.matchAll(/(\w+)=("(?:[^"]|\\.)*"|\S+?)(?=[\s,]|$)/g)) {
+    const [, key, raw] = m;
+    const v = raw.startsWith('"') && raw.endsWith('"') ? raw.slice(1, -1) : raw;
+    attrs[key] = v;
+  }
+  return attrs;
+}
+function parseLibpetriDot(dot) {
+  const nodes = /* @__PURE__ */ new Map();
+  for (const m of dot.matchAll(/^\s*([pjt]_[A-Za-z0-9_]+)\s*\[(.*)\];\s*$/gm)) {
+    const [, id, body] = m;
+    nodes.set(id, { id, kind: classifyKind(id), attrs: parseAttrs(body) });
+  }
+  const clusters = /* @__PURE__ */ new Map();
+  const nodeToCluster = /* @__PURE__ */ new Map();
+  for (const cm of dot.matchAll(/subgraph (cluster_\w+)\s*\{([^]*?)^\s*\}/gm)) {
+    const [, clusterId, body] = cm;
+    const memberIds = [...body.matchAll(/^\s*([pjt]_[A-Za-z0-9_]+)\s*\[/gm)].map((m) => m[1]);
+    clusters.set(clusterId, {
+      id: clusterId,
+      shortName: clusterId.replace(/^cluster_/, ""),
+      nodes: memberIds
+    });
+    for (const n of memberIds) nodeToCluster.set(n, clusterId);
+  }
+  const stripped = dot.replace(/subgraph cluster_\w+\s*\{[^]*?^\s*\}/gm, "");
+  for (const m of stripped.matchAll(/^\s*([pjt]_[A-Za-z0-9_]+)\s*\[/gm)) {
+    const id = m[1];
+    if (!nodes.has(id)) {
+      nodes.set(id, { id, kind: classifyKind(id), attrs: {} });
+    }
+  }
+  const orphans = [...nodes.keys()].filter((n) => !nodeToCluster.has(n));
+  const edges = [];
+  for (const m of dot.matchAll(/([pjt]_[A-Za-z0-9_]+)\s*->\s*([pjt]_[A-Za-z0-9_]+)\s*(\[[^\]]*\])?/g)) {
+    const [, src, dst, rawAttrs] = m;
+    const attrs = rawAttrs ?? "";
+    if (attrs.includes("lhead=") || attrs.includes("ltail=")) continue;
+    let arc = "normal";
+    if (attrs.includes('label="reset"') || attrs.includes("#fd7e14")) arc = "reset";
+    else if (attrs.includes('arrowhead="odot"') || attrs.includes("#dc3545")) arc = "inhibitor";
+    else if (attrs.includes('label="read"')) arc = "read";
+    const stripped2 = attrs.startsWith("[") && attrs.endsWith("]") ? attrs.slice(1, -1) : "";
+    edges.push({ src, dst, arc, rawAttrs: stripped2 });
+  }
+  return { nodes, clusters, nodeToCluster, orphans, edges };
+}
+function foldOrphans(graph, threshold = 0.7) {
+  if (threshold <= 0) return graph;
+  const nodeToCluster = new Map(graph.nodeToCluster);
+  const clusterMembers = /* @__PURE__ */ new Map();
+  for (const [id, c] of graph.clusters) clusterMembers.set(id, [...c.nodes]);
+  const tally = /* @__PURE__ */ new Map();
+  const bump = (orphan, other) => {
+    const oc = nodeToCluster.get(other);
+    if (!oc) return;
+    let t = tally.get(orphan);
+    if (!t) {
+      t = /* @__PURE__ */ new Map();
+      tally.set(orphan, t);
+    }
+    t.set(oc, (t.get(oc) ?? 0) + 1);
+  };
+  for (const e of graph.edges) {
+    const sIsOrphan = !nodeToCluster.has(e.src);
+    const dIsOrphan = !nodeToCluster.has(e.dst);
+    if (sIsOrphan && !dIsOrphan) bump(e.src, e.dst);
+    if (dIsOrphan && !sIsOrphan) bump(e.dst, e.src);
+  }
+  for (const id of graph.orphans) {
+    const t = tally.get(id);
+    if (!t) continue;
+    let total = 0;
+    let bestCluster = null;
+    let bestCount = 0;
+    for (const [c, n] of t) {
+      total += n;
+      if (n > bestCount) {
+        bestCount = n;
+        bestCluster = c;
+      }
+    }
+    if (bestCluster && total > 0 && bestCount / total >= threshold) {
+      clusterMembers.get(bestCluster).push(id);
+      nodeToCluster.set(id, bestCluster);
+    }
+  }
+  const clusters = /* @__PURE__ */ new Map();
+  for (const [id, c] of graph.clusters) {
+    clusters.set(id, { ...c, nodes: clusterMembers.get(id) });
+  }
+  const orphans = [...graph.nodes.keys()].filter((n) => !nodeToCluster.has(n));
+  return { ...graph, clusters, nodeToCluster, orphans };
+}
+function replicateShared(graph, opts = {}) {
+  const max = opts.max ?? Infinity;
+  const replicateTransitions = opts.replicateTransitions ?? false;
+  const nodes = new Map(graph.nodes);
+  const nodeToCluster = new Map(graph.nodeToCluster);
+  const clusterMembers = /* @__PURE__ */ new Map();
+  for (const [id, c] of graph.clusters) clusterMembers.set(id, [...c.nodes]);
+  const edges = graph.edges.map((e) => ({ ...e }));
+  const foreignByNode = /* @__PURE__ */ new Map();
+  const noteForeign = (nodeId, otherId) => {
+    if (!nodeId.startsWith("p_") && !(replicateTransitions && nodeId.startsWith("t_"))) return;
+    const home = nodeToCluster.get(nodeId);
+    const otherCluster = nodeToCluster.get(otherId);
+    if (!otherCluster) return;
+    if (otherCluster === home) return;
+    let s = foreignByNode.get(nodeId);
+    if (!s) {
+      s = /* @__PURE__ */ new Set();
+      foreignByNode.set(nodeId, s);
+    }
+    s.add(otherCluster);
+  };
+  for (const e of edges) {
+    noteForeign(e.src, e.dst);
+    noteForeign(e.dst, e.src);
+  }
+  const replicaMap = /* @__PURE__ */ new Map();
+  let replicatedPlaces = 0;
+  let totalCopies = 0;
+  for (const [placeId, foreigns] of foreignByNode) {
+    if (foreigns.size === 0) continue;
+    if (foreigns.size > max) continue;
+    const perCluster = /* @__PURE__ */ new Map();
+    const orig = nodes.get(placeId);
+    if (!orig) continue;
+    for (const clusterId of foreigns) {
+      const shortName = clusterId.replace(/^cluster_/, "");
+      const repId = `${placeId}__rep__${shortName}`;
+      perCluster.set(clusterId, repId);
+      clusterMembers.get(clusterId).push(repId);
+      nodeToCluster.set(repId, clusterId);
+      nodes.set(repId, {
+        id: repId,
+        kind: orig.kind,
+        attrs: { ...orig.attrs },
+        replica: true,
+        replicaOf: placeId
+      });
+      totalCopies++;
+    }
+    replicaMap.set(placeId, perCluster);
+    replicatedPlaces++;
+    nodes.set(placeId, { ...orig, replica: true, replicaOf: placeId });
+  }
+  for (const e of edges) {
+    const sMap = replicaMap.get(e.src);
+    const dMap = replicaMap.get(e.dst);
+    if (sMap) {
+      const dCl = nodeToCluster.get(e.dst);
+      if (dCl && sMap.has(dCl)) e.src = sMap.get(dCl);
+    }
+    if (dMap) {
+      const sCl = nodeToCluster.get(e.src);
+      if (sCl && dMap.has(sCl)) e.dst = dMap.get(sCl);
+    }
+  }
+  for (const [origId] of replicaMap) {
+    if (nodeToCluster.has(origId)) continue;
+    const stillHasEdge = edges.some((e) => e.src === origId || e.dst === origId);
+    if (!stillHasEdge) nodes.delete(origId);
+  }
+  const clusters = /* @__PURE__ */ new Map();
+  for (const [id, c] of graph.clusters) {
+    clusters.set(id, { ...c, nodes: clusterMembers.get(id) });
+  }
+  const orphans = [...nodes.keys()].filter((n) => !nodeToCluster.has(n));
+  return {
+    nodes,
+    clusters,
+    nodeToCluster,
+    orphans,
+    edges,
+    replicateStats: { replicatedPlaces, totalCopies }
+  };
+}
+
+// src/viewer/layout/elk-place.ts
+import ELK from "elkjs/lib/elk.bundled.js";
+var ORCHESTRATOR_CLUSTER_ID = "cluster_orchestrator";
+var PLACE_RADIUS = 22;
+var PLACE_CHARW = 7.4;
+var PLACE_PAD_BELOW = 16;
+var FONT_PLACE = 13;
+var TRANSITION_MIN_W = 180;
+var TRANSITION_H = 40;
+var TRANSITION_CHARW = 8.5;
+var JUNCTION_SIZE = 28;
+var FONT_CLUSTER = 17;
+var ROOT_SPACING = 90;
+var CLUSTER_SPACING = 16;
+function nodeDims(node) {
+  if (node.kind === "place") {
+    const label2 = (node.attrs.xlabel ?? node.attrs.label ?? node.id).replace(/\\n/g, " ");
+    const labelWidth = label2.length * PLACE_CHARW;
+    const circleD = PLACE_RADIUS * 2 + 4;
+    return {
+      width: Math.max(circleD, labelWidth),
+      height: circleD + PLACE_PAD_BELOW + FONT_PLACE
+    };
+  }
+  if (node.kind === "junction") {
+    return { width: JUNCTION_SIZE, height: JUNCTION_SIZE };
+  }
+  const label = (node.attrs.label ?? node.id).replace(/\\n/g, " ");
+  return {
+    width: Math.max(TRANSITION_MIN_W, label.length * TRANSITION_CHARW),
+    height: TRANSITION_H
+  };
+}
+var CLUSTER_OPTIONS = {
+  "elk.padding": `[top=${FONT_CLUSTER + 16},left=16,bottom=16,right=16]`,
+  "elk.algorithm": "layered",
+  "elk.direction": "DOWN",
+  "elk.spacing.nodeNode": String(CLUSTER_SPACING),
+  "elk.layered.spacing.nodeNodeBetweenLayers": String(CLUSTER_SPACING + 6),
+  "elk.edgeRouting": "ORTHOGONAL"
+};
+var ROOT_OPTIONS = {
+  "elk.algorithm": "org.eclipse.elk.rectpacking",
+  "elk.aspectRatio": "1.4",
+  "elk.padding": "[top=24,left=24,bottom=24,right=24]",
+  "elk.spacing.nodeNode": String(ROOT_SPACING)
+};
+var ORCHESTRATOR_OPTIONS = {
+  ...CLUSTER_OPTIONS,
+  "elk.aspectRatio": "2.4",
+  "elk.spacing.nodeNode": "10"
+};
+function partitionEdges(graph) {
+  const byCluster = /* @__PURE__ */ new Map();
+  const cross = [];
+  const edgeIdToKey = /* @__PURE__ */ new Map();
+  const ownerOf = (id) => graph.nodeToCluster.get(id) ?? ORCHESTRATOR_CLUSTER_ID;
+  graph.edges.forEach((e, i) => {
+    const so = ownerOf(e.src);
+    const dt = ownerOf(e.dst);
+    const id = `e${i}`;
+    edgeIdToKey.set(id, `${e.src}->${e.dst}`);
+    const elkEdge = {
+      id,
+      sources: [e.src],
+      targets: [e.dst]
+    };
+    if (so === dt) {
+      let list = byCluster.get(so);
+      if (!list) {
+        list = [];
+        byCluster.set(so, list);
+      }
+      list.push(elkEdge);
+    } else {
+      cross.push(elkEdge);
+    }
+  });
+  return { byCluster, cross, edgeIdToKey };
+}
+async function elkLayout(graph) {
+  const { byCluster, cross, edgeIdToKey } = partitionEdges(graph);
+  const elkChildren = [];
+  for (const [clusterId, cluster] of graph.clusters) {
+    elkChildren.push({
+      id: clusterId,
+      layoutOptions: CLUSTER_OPTIONS,
+      children: cluster.nodes.map((id) => graph.nodes.get(id)).filter((n) => n !== void 0).map((n) => ({ id: n.id, ...nodeDims(n) })),
+      edges: byCluster.get(clusterId) ?? []
+    });
+  }
+  elkChildren.push({
+    id: ORCHESTRATOR_CLUSTER_ID,
+    layoutOptions: ORCHESTRATOR_OPTIONS,
+    children: graph.orphans.map((id) => graph.nodes.get(id)).filter((n) => n !== void 0).map((n) => ({ id: n.id, ...nodeDims(n) })),
+    edges: byCluster.get(ORCHESTRATOR_CLUSTER_ID) ?? []
+  });
+  const elk = new ELK();
+  const rootGraph = {
+    id: "root",
+    layoutOptions: ROOT_OPTIONS,
+    children: elkChildren,
+    edges: cross
+  };
+  const layout = await elk.layout(rootGraph);
+  const nodePositions = /* @__PURE__ */ new Map();
+  const clusterBoxes = /* @__PURE__ */ new Map();
+  const edgePaths = /* @__PURE__ */ new Map();
+  const walk = (node, parentX, parentY) => {
+    const ax = parentX + (node.x ?? 0);
+    const ay = parentY + (node.y ?? 0);
+    const isCluster = node.id !== "root" && (node.children?.length ?? 0) > 0;
+    if (isCluster) {
+      clusterBoxes.set(node.id, {
+        x: ax,
+        y: ay,
+        width: node.width ?? 0,
+        height: node.height ?? 0
+      });
+    }
+    if (node.id !== "root" && !isCluster) {
+      nodePositions.set(node.id, {
+        x: ax,
+        y: ay,
+        width: node.width ?? 0,
+        height: node.height ?? 0
+      });
+    }
+    const edgeOffsetX = node.id === "root" ? parentX : ax;
+    const edgeOffsetY = node.id === "root" ? parentY : ay;
+    for (const edge of node.edges ?? []) {
+      const key = edge.id ? edgeIdToKey.get(edge.id) : void 0;
+      const section = edge.sections?.[0];
+      if (!key || !section) continue;
+      edgePaths.set(key, {
+        start: {
+          x: edgeOffsetX + section.startPoint.x,
+          y: edgeOffsetY + section.startPoint.y
+        },
+        end: {
+          x: edgeOffsetX + section.endPoint.x,
+          y: edgeOffsetY + section.endPoint.y
+        },
+        bends: (section.bendPoints ?? []).map((p) => ({
+          x: edgeOffsetX + p.x,
+          y: edgeOffsetY + p.y
+        }))
+      });
+    }
+    for (const child of node.children ?? []) walk(child, ax, ay);
+  };
+  walk(layout, 0, 0);
+  return {
+    nodePositions,
+    clusterBoxes,
+    edgePaths,
+    totalWidth: layout.width ?? 0,
+    totalHeight: layout.height ?? 0
+  };
+}
+function quote(value) {
+  return `"${value.replace(/\\/g, "\\\\").replace(/"/g, '\\"')}"`;
+}
+function nodeAttrLine(node, pos) {
+  const attrs = [];
+  const cx = pos.x + pos.width / 2;
+  const cy = pos.y + pos.height / 2;
+  attrs.push(`pos=${quote(`${cx.toFixed(2)},${cy.toFixed(2)}!`)}`);
+  for (const [k, v] of Object.entries(node.attrs)) {
+    if (k === "pos") continue;
+    attrs.push(`${k}=${quote(v)}`);
+  }
+  return `${node.id} [${attrs.join(", ")}];`;
+}
+function edgeAttrLine(src, dst, rawAttrs) {
+  const body = rawAttrs.trim();
+  return `${src} -> ${dst}` + (body ? ` [${body}];` : ";");
+}
+function writeBack(graph, layout) {
+  const lines = [];
+  lines.push("digraph LibpetriPinned {");
+  lines.push("    rankdir=TB;");
+  lines.push('    overlap="false";');
+  lines.push('    compound="true";');
+  lines.push('    fontname="Helvetica,Arial,sans-serif";');
+  lines.push('    outputorder="edgesfirst";');
+  lines.push('    node [fontname="Helvetica,Arial,sans-serif", fontsize=10];');
+  lines.push('    edge [fontname="Helvetica,Arial,sans-serif", fontsize=9];');
+  for (const [clusterId, cluster] of graph.clusters) {
+    const box = layout.clusterBoxes.get(clusterId);
+    lines.push(`    subgraph ${clusterId} {`);
+    lines.push(`        label=${quote(cluster.shortName)};`);
+    lines.push(`        style="rounded,dashed";`);
+    lines.push(`        bgcolor="#FAFAFA";`);
+    lines.push(`        penwidth=1.5;`);
+    if (box) {
+      const x1 = box.x.toFixed(2);
+      const y1 = box.y.toFixed(2);
+      const x2 = (box.x + box.width).toFixed(2);
+      const y2 = (box.y + box.height).toFixed(2);
+      lines.push(`        bb=${quote(`${x1},${y1},${x2},${y2}`)};`);
+    }
+    for (const nodeId of cluster.nodes) {
+      const node = graph.nodes.get(nodeId);
+      const pos = layout.nodePositions.get(nodeId);
+      if (!node || !pos) continue;
+      lines.push("        " + nodeAttrLine(node, pos));
+    }
+    lines.push("    }");
+  }
+  for (const orphanId of graph.orphans) {
+    const node = graph.nodes.get(orphanId);
+    const pos = layout.nodePositions.get(orphanId);
+    if (!node || !pos) continue;
+    lines.push("    " + nodeAttrLine(node, pos));
+  }
+  for (const edge of graph.edges) {
+    lines.push("    " + edgeAttrLine(edge.src, edge.dst, edge.rawAttrs));
+  }
+  lines.push("}");
+  return lines.join("\n");
+}
+
+export {
+  parseLibpetriDot,
+  foldOrphans,
+  replicateShared,
+  elkLayout,
+  writeBack
+};
+//# sourceMappingURL=chunk-RNWTYK5B.js.map

package/dist/chunk-RNWTYK5B.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/viewer/layout/preprocess.ts","../src/viewer/layout/elk-place.ts"],"sourcesContent":["/**\n * Graph pre-processing for the C0-replicate-default layout pipeline.\n *\n * Three pure-ish transforms operate on a {@link GraphModel} parsed from a\n * libpetri-exported DOT string:\n *\n *   parseLibpetriDot(dot)           → GraphModel\n *   foldOrphans(graph, threshold)   → GraphModel    (REASSIGN_ORPHANS)\n *   replicateShared(graph, opts)    → GraphModel    (REPLICATE_SHARED)\n *\n * The pipeline turns a flat cluster soup into a cluster-internal one by\n * (a) folding orphan nodes whose edges concentrate in one cluster into that\n * cluster, and (b) cloning shared places into every foreign cluster they\n * touch so cross-cluster spaghetti disappears. The resulting GraphModel is\n * what ELK lays out (Stage 2) and Graphviz then renders in pin-mode.\n *\n * Algorithm lineage: ported from\n * `/home/db/otto-repos/nucleus_marvin/.scratch/javadoc-layout-exp/CHECKPOINTS/run16_GOOD_v3_skip-junctions.mjs`\n * lines 14–220. The arc-type detection, replica naming\n * (`${placeId}__rep__${clusterShortName}`), and the `__replica` /\n * `replicaOf` markers are load-bearing — downstream stages key off them.\n *\n * @module viewer/layout/preprocess\n */\n\nexport type ArcType = 'normal' | 'reset' | 'inhibitor' | 'read';\nexport type NodeKind = 'place' | 'transition' | 'junction';\n\nexport interface ParsedNode {\n  readonly id: string;\n  readonly kind: NodeKind;\n  readonly attrs: Record<string, string>;\n  /** True iff this node was emitted by replicateShared. */\n  readonly replica?: boolean;\n  /** For a replica, the id of the original logical place. */\n  readonly replicaOf?: string;\n}\n\nexport interface ParsedEdge {\n  readonly src: string;\n  readonly dst: string;\n  readonly arc: ArcType;\n  /**\n   * Raw attribute body from the libpetri DOT (between the `[…]` brackets,\n   * brackets stripped). Carries style/penwidth/label that we want to\n   * round-trip verbatim so the rendered output matches `DotExporter`'s\n   * native look.\n   */\n  readonly rawAttrs: string;\n}\n\nexport interface ParsedCluster {\n  readonly id: string;          // \"cluster_productSearch\"\n  readonly shortName: string;   // \"productSearch\"\n  readonly nodes: readonly string[];\n}\n\nexport interface GraphModel {\n  readonly nodes: ReadonlyMap<string, ParsedNode>;\n  readonly clusters: ReadonlyMap<string, ParsedCluster>;\n  readonly nodeToCluster: ReadonlyMap<string, string>;\n  /** Node ids not in any cluster (rendered at the orchestrator root). */\n  readonly orphans: readonly string[];\n  readonly edges: readonly ParsedEdge[];\n}\n\nfunction classifyKind(id: string): NodeKind {\n  if (id.startsWith('p_')) return 'place';\n  if (id.startsWith('t_')) return 'transition';\n  return 'junction';\n}\n\n/**\n * Recover key=value attributes from inside a DOT `[...]` block.\n *\n * Mirrors v3 line 29. The regex is intentionally permissive about quoted\n * values containing escaped quotes; it does not validate DOT syntax.\n */\nfunction parseAttrs(body: string): Record<string, string> {\n  const attrs: Record<string, string> = {};\n  for (const m of body.matchAll(/(\\w+)=(\"(?:[^\"]|\\\\.)*\"|\\S+?)(?=[\\s,]|$)/g)) {\n    const [, key, raw] = m as unknown as [string, string, string];\n    const v = raw.startsWith('\"') && raw.endsWith('\"') ? raw.slice(1, -1) : raw;\n    attrs[key] = v;\n  }\n  return attrs;\n}\n\n/**\n * Parse a libpetri-exported DOT string into a {@link GraphModel}.\n *\n * Tolerates the current exporter shape (see\n * `java/src/main/java/org/libpetri/export/StyleConstants.java`):\n *  - inhibitor arcs use `arrowhead=\"odot\"` + color `#dc3545`\n *  - reset arcs use `label=\"reset\"` + color `#fd7e14`\n *  - read arcs use `label=\"read\"` + color `#6c757d`\n *\n * Mirrors v3 lines 24–103.\n */\nexport function parseLibpetriDot(dot: string): GraphModel {\n  const nodes = new Map<string, ParsedNode>();\n  // Greedy `.*` (no /s flag) consumes the full attrs body up to the line's\n  // trailing `];`. The v3 reference used `[^\\]]*` which silently dropped\n  // transitions whose label contained `[…]` text (e.g., `\"[0, ∞]ms\"`); we\n  // can't tolerate that here because the typed model wants every cluster\n  // member to have a Node entry.\n  for (const m of dot.matchAll(/^\\s*([pjt]_[A-Za-z0-9_]+)\\s*\\[(.*)\\];\\s*$/gm)) {\n    const [, id, body] = m as unknown as [string, string, string];\n    nodes.set(id, { id, kind: classifyKind(id), attrs: parseAttrs(body) });\n  }\n\n  const clusters = new Map<string, ParsedCluster>();\n  const nodeToCluster = new Map<string, string>();\n  for (const cm of dot.matchAll(/subgraph (cluster_\\w+)\\s*\\{([^]*?)^\\s*\\}/gm)) {\n    const [, clusterId, body] = cm as unknown as [string, string, string];\n    const memberIds = [...body.matchAll(/^\\s*([pjt]_[A-Za-z0-9_]+)\\s*\\[/gm)]\n      .map(m => (m as unknown as [string, string])[1]);\n    clusters.set(clusterId, {\n      id: clusterId,\n      shortName: clusterId.replace(/^cluster_/, ''),\n      nodes: memberIds,\n    });\n    for (const n of memberIds) nodeToCluster.set(n, clusterId);\n  }\n\n  // Catch nodes declared at root (orphans) — strip cluster bodies, then scan\n  const stripped = dot.replace(/subgraph cluster_\\w+\\s*\\{[^]*?^\\s*\\}/gm, '');\n  for (const m of stripped.matchAll(/^\\s*([pjt]_[A-Za-z0-9_]+)\\s*\\[/gm)) {\n    const id = (m as unknown as [string, string])[1];\n    if (!nodes.has(id)) {\n      // Root-declared node without full attrs (rare); seed with empty attrs.\n      nodes.set(id, { id, kind: classifyKind(id), attrs: {} });\n    }\n  }\n\n  const orphans = [...nodes.keys()].filter(n => !nodeToCluster.has(n));\n\n  const edges: ParsedEdge[] = [];\n  for (const m of dot.matchAll(/([pjt]_[A-Za-z0-9_]+)\\s*->\\s*([pjt]_[A-Za-z0-9_]+)\\s*(\\[[^\\]]*\\])?/g)) {\n    const [, src, dst, rawAttrs] = m as unknown as [string, string, string, string | undefined];\n    const attrs = rawAttrs ?? '';\n    // Cluster-anchor edges (lhead/ltail) are exporter-internal routing hints,\n    // not real arcs in the Petri net — skip per v3 line 97.\n    if (attrs.includes('lhead=') || attrs.includes('ltail=')) continue;\n    let arc: ArcType = 'normal';\n    if (attrs.includes('label=\"reset\"') || attrs.includes('#fd7e14')) arc = 'reset';\n    else if (attrs.includes('arrowhead=\"odot\"') || attrs.includes('#dc3545')) arc = 'inhibitor';\n    else if (attrs.includes('label=\"read\"')) arc = 'read';\n    // Strip the `[…]` brackets so writeBack can splice the body into a new\n    // attr list. Empty if libpetri emitted a bare `src -> dst;`.\n    const stripped = attrs.startsWith('[') && attrs.endsWith(']')\n      ? attrs.slice(1, -1)\n      : '';\n    edges.push({ src, dst, arc, rawAttrs: stripped });\n  }\n\n  return { nodes, clusters, nodeToCluster, orphans, edges };\n}\n\n/**\n * Adopt orphan nodes into the cluster their edges most prefer.\n *\n * For each orphan, tally how many of its edges touch each cluster. If the\n * dominant cluster gets at least `threshold` of the orphan's cluster-touching\n * edges, the orphan is reassigned to that cluster.\n *\n * Mirrors v3 lines 105–136. Default threshold 0.7 matches REASSIGN_ORPHANS.\n */\nexport function foldOrphans(graph: GraphModel, threshold = 0.7): GraphModel {\n  if (threshold <= 0) return graph;\n\n  const nodeToCluster = new Map(graph.nodeToCluster);\n  const clusterMembers = new Map<string, string[]>();\n  for (const [id, c] of graph.clusters) clusterMembers.set(id, [...c.nodes]);\n\n  const tally = new Map<string, Map<string, number>>();\n  const bump = (orphan: string, other: string): void => {\n    const oc = nodeToCluster.get(other);\n    if (!oc) return;\n    let t = tally.get(orphan);\n    if (!t) { t = new Map(); tally.set(orphan, t); }\n    t.set(oc, (t.get(oc) ?? 0) + 1);\n  };\n\n  for (const e of graph.edges) {\n    const sIsOrphan = !nodeToCluster.has(e.src);\n    const dIsOrphan = !nodeToCluster.has(e.dst);\n    if (sIsOrphan && !dIsOrphan) bump(e.src, e.dst);\n    if (dIsOrphan && !sIsOrphan) bump(e.dst, e.src);\n  }\n\n  for (const id of graph.orphans) {\n    const t = tally.get(id);\n    if (!t) continue;\n    let total = 0;\n    let bestCluster: string | null = null;\n    let bestCount = 0;\n    for (const [c, n] of t) {\n      total += n;\n      if (n > bestCount) { bestCount = n; bestCluster = c; }\n    }\n    if (bestCluster && total > 0 && bestCount / total >= threshold) {\n      clusterMembers.get(bestCluster)!.push(id);\n      nodeToCluster.set(id, bestCluster);\n    }\n  }\n\n  const clusters = new Map<string, ParsedCluster>();\n  for (const [id, c] of graph.clusters) {\n    clusters.set(id, { ...c, nodes: clusterMembers.get(id)! });\n  }\n  const orphans = [...graph.nodes.keys()].filter(n => !nodeToCluster.has(n));\n  return { ...graph, clusters, nodeToCluster, orphans };\n}\n\nexport interface ReplicateOptions {\n  /**\n   * Skip places that touch more than this many foreign clusters. Per the\n   * plan's \"no cap\" decision, default is `Infinity`. Set to a finite value\n   * to suppress replication of hub places that would otherwise produce many\n   * copies.\n   */\n  readonly max?: number;\n  /** If true, replicate transitions as well as places. Default false. */\n  readonly replicateTransitions?: boolean;\n}\n\nexport interface ReplicateStats {\n  readonly replicatedPlaces: number;\n  readonly totalCopies: number;\n}\n\n/**\n * For each place P, replicate it into every foreign cluster touched by its\n * edges, and redirect those cross-cluster edges to the local copy.\n *\n * Replica id convention is load-bearing: `${placeId}__rep__${shortClusterName}`.\n * Downstream stages (mount-time tagging, overlay highlight, click-all-copies)\n * key off this naming and the `replica: true` / `replicaOf` markers.\n *\n * If P has a home cluster (folded earlier), the original stays as the primary\n * copy and is also marked as a replica so the ⇄ glyph renders consistently.\n * If P is an orphan with all its edges redirected, the original is dropped.\n *\n * Mirrors v3 lines 138–221.\n */\nexport function replicateShared(\n  graph: GraphModel,\n  opts: ReplicateOptions = {},\n): GraphModel & { readonly replicateStats: ReplicateStats } {\n  const max = opts.max ?? Infinity;\n  const replicateTransitions = opts.replicateTransitions ?? false;\n\n  const nodes = new Map(graph.nodes);\n  const nodeToCluster = new Map(graph.nodeToCluster);\n  const clusterMembers = new Map<string, string[]>();\n  for (const [id, c] of graph.clusters) clusterMembers.set(id, [...c.nodes]);\n  const edges = graph.edges.map(e => ({ ...e }));\n\n  // 1. Compute foreign-cluster set per replicable node.\n  const foreignByNode = new Map<string, Set<string>>();\n  const noteForeign = (nodeId: string, otherId: string): void => {\n    if (!nodeId.startsWith('p_') && !(replicateTransitions && nodeId.startsWith('t_'))) return;\n    const home = nodeToCluster.get(nodeId);\n    const otherCluster = nodeToCluster.get(otherId);\n    if (!otherCluster) return;\n    if (otherCluster === home) return;\n    let s = foreignByNode.get(nodeId);\n    if (!s) { s = new Set(); foreignByNode.set(nodeId, s); }\n    s.add(otherCluster);\n  };\n  for (const e of edges) {\n    noteForeign(e.src, e.dst);\n    noteForeign(e.dst, e.src);\n  }\n\n  // 2. Emit replicas for nodes within the cap.\n  const replicaMap = new Map<string, Map<string, string>>();  // orig → cluster → replicaId\n  let replicatedPlaces = 0;\n  let totalCopies = 0;\n  for (const [placeId, foreigns] of foreignByNode) {\n    if (foreigns.size === 0) continue;\n    if (foreigns.size > max) continue;\n    const perCluster = new Map<string, string>();\n    const orig = nodes.get(placeId);\n    if (!orig) continue;\n    for (const clusterId of foreigns) {\n      const shortName = clusterId.replace(/^cluster_/, '');\n      const repId = `${placeId}__rep__${shortName}`;\n      perCluster.set(clusterId, repId);\n      clusterMembers.get(clusterId)!.push(repId);\n      nodeToCluster.set(repId, clusterId);\n      nodes.set(repId, {\n        id: repId,\n        kind: orig.kind,\n        attrs: { ...orig.attrs },\n        replica: true,\n        replicaOf: placeId,\n      });\n      totalCopies++;\n    }\n    replicaMap.set(placeId, perCluster);\n    replicatedPlaces++;\n    // Mark the original as a shared place so the ⇄ glyph renders uniformly.\n    nodes.set(placeId, { ...orig, replica: true, replicaOf: placeId });\n  }\n\n  // 3. Redirect cross-cluster edges to the local replica on each end.\n  for (const e of edges) {\n    const sMap = replicaMap.get(e.src);\n    const dMap = replicaMap.get(e.dst);\n    if (sMap) {\n      const dCl = nodeToCluster.get(e.dst);\n      if (dCl && sMap.has(dCl)) e.src = sMap.get(dCl)!;\n    }\n    if (dMap) {\n      const sCl = nodeToCluster.get(e.src);\n      if (sCl && dMap.has(sCl)) e.dst = dMap.get(sCl)!;\n    }\n  }\n\n  // 4. Drop orphan originals whose edges all got redirected away.\n  for (const [origId] of replicaMap) {\n    if (nodeToCluster.has(origId)) continue;  // folded — keep as primary\n    const stillHasEdge = edges.some(e => e.src === origId || e.dst === origId);\n    if (!stillHasEdge) nodes.delete(origId);\n  }\n\n  const clusters = new Map<string, ParsedCluster>();\n  for (const [id, c] of graph.clusters) {\n    clusters.set(id, { ...c, nodes: clusterMembers.get(id)! });\n  }\n  const orphans = [...nodes.keys()].filter(n => !nodeToCluster.has(n));\n\n  return {\n    nodes,\n    clusters,\n    nodeToCluster,\n    orphans,\n    edges,\n    replicateStats: { replicatedPlaces, totalCopies },\n  };\n}\n","/**\n * ELK placement + DOT pin-mode rewrite.\n *\n * Stage 2 of the C0 pipeline. Takes the {@link GraphModel} produced by\n * {@link parseLibpetriDot} → {@link foldOrphans} → {@link replicateShared},\n * runs ELKjs to compute absolute `(x, y)` per node and bounding boxes per\n * cluster, then emits a fresh DOT string with positions pinned via\n * `pos=\"x,y!\"` and `bb=\"…\"`. Downstream callers render the result through\n * `@viz-js/viz` with `engine: 'neato'` + `graphAttributes: { nop: '1' }` —\n * Graphviz uses the pinned positions verbatim and routes edges around the\n * pinned cluster boundaries.\n *\n * The two functions are pure: `elkLayout` takes only the graph; `writeBack`\n * takes (graph, layout). Neither touches the original DOT text — the model\n * after replication has nodes the original DOT doesn't, so patching the\n * original would be incorrect.\n *\n * @module viewer/layout/elk-place\n */\n\nimport ELK from 'elkjs/lib/elk.bundled.js';\nimport type {\n  ElkExtendedEdge,\n  ElkNode,\n} from 'elkjs/lib/elk-api.js';\nimport type { GraphModel, ParsedNode } from './preprocess.js';\n\nconst ORCHESTRATOR_CLUSTER_ID = 'cluster_orchestrator';\n\n// Visual sizing — kept proportional to the v3 reference renderer so the\n// resulting bounding box is comparable to C0-GOOD_v3.svg.\nconst PLACE_RADIUS = 22;\nconst PLACE_CHARW = 7.4;\nconst PLACE_PAD_BELOW = 16;\nconst FONT_PLACE = 13;\nconst TRANSITION_MIN_W = 180;\nconst TRANSITION_H = 40;\nconst TRANSITION_CHARW = 8.5;\nconst JUNCTION_SIZE = 28;\nconst FONT_CLUSTER = 17;\nconst ROOT_SPACING = 90;\nconst CLUSTER_SPACING = 16;\n\n/**\n * Width/height in points that ELK should reserve for a node. Mirrors\n * `nodeDims` in v3 lines 66–78 — places get extra height to leave room for\n * the xlabel underneath the circle.\n */\nfunction nodeDims(node: ParsedNode): { width: number; height: number } {\n  if (node.kind === 'place') {\n    const label = (node.attrs.xlabel ?? node.attrs.label ?? node.id).replace(/\\\\n/g, ' ');\n    const labelWidth = label.length * PLACE_CHARW;\n    const circleD = PLACE_RADIUS * 2 + 4;\n    return {\n      width: Math.max(circleD, labelWidth),\n      height: circleD + PLACE_PAD_BELOW + FONT_PLACE,\n    };\n  }\n  if (node.kind === 'junction') {\n    return { width: JUNCTION_SIZE, height: JUNCTION_SIZE };\n  }\n  const label = (node.attrs.label ?? node.id).replace(/\\\\n/g, ' ');\n  return {\n    width: Math.max(TRANSITION_MIN_W, label.length * TRANSITION_CHARW),\n    height: TRANSITION_H,\n  };\n}\n\nexport interface NodePosition {\n  readonly x: number;\n  readonly y: number;\n  readonly width: number;\n  readonly height: number;\n}\n\nexport interface ClusterBox {\n  readonly x: number;\n  readonly y: number;\n  readonly width: number;\n  readonly height: number;\n}\n\nexport interface EdgePath {\n  readonly start: { x: number; y: number };\n  readonly end: { x: number; y: number };\n  readonly bends: ReadonlyArray<{ x: number; y: number }>;\n}\n\nexport interface LayoutResult {\n  readonly nodePositions: ReadonlyMap<string, NodePosition>;\n  readonly clusterBoxes: ReadonlyMap<string, ClusterBox>;\n  /** Keyed on `${src}->${dst}` — ELK-computed edge routes for `nop=2`. */\n  readonly edgePaths: ReadonlyMap<string, EdgePath>;\n  readonly totalWidth: number;\n  readonly totalHeight: number;\n}\n\nconst CLUSTER_OPTIONS: Record<string, string> = {\n  'elk.padding': `[top=${FONT_CLUSTER + 16},left=16,bottom=16,right=16]`,\n  'elk.algorithm': 'layered',\n  'elk.direction': 'DOWN',\n  'elk.spacing.nodeNode': String(CLUSTER_SPACING),\n  'elk.layered.spacing.nodeNodeBetweenLayers': String(CLUSTER_SPACING + 6),\n  'elk.edgeRouting': 'ORTHOGONAL',\n};\n\nconst ROOT_OPTIONS: Record<string, string> = {\n  'elk.algorithm': 'org.eclipse.elk.rectpacking',\n  'elk.aspectRatio': '1.4',\n  'elk.padding': '[top=24,left=24,bottom=24,right=24]',\n  'elk.spacing.nodeNode': String(ROOT_SPACING),\n};\n\nconst ORCHESTRATOR_OPTIONS: Record<string, string> = {\n  ...CLUSTER_OPTIONS,\n  'elk.aspectRatio': '2.4',\n  'elk.spacing.nodeNode': '10',\n};\n\n/**\n * Group edges by the cluster that contains both endpoints (or 'root' if\n * the edge crosses cluster boundaries).\n *\n * Orphans count as living in `cluster_orchestrator` for routing purposes,\n * matching v3's `ownerOf` (line 223).\n */\nfunction partitionEdges(graph: GraphModel): {\n  byCluster: Map<string, ElkExtendedEdge[]>;\n  cross: ElkExtendedEdge[];\n  /** edgeId → \"src->dst\" so the layout walk can recover the original key. */\n  edgeIdToKey: Map<string, string>;\n} {\n  const byCluster = new Map<string, ElkExtendedEdge[]>();\n  const cross: ElkExtendedEdge[] = [];\n  const edgeIdToKey = new Map<string, string>();\n  const ownerOf = (id: string): string =>\n    graph.nodeToCluster.get(id) ?? ORCHESTRATOR_CLUSTER_ID;\n\n  graph.edges.forEach((e, i) => {\n    const so = ownerOf(e.src);\n    const dt = ownerOf(e.dst);\n    const id = `e${i}`;\n    edgeIdToKey.set(id, `${e.src}->${e.dst}`);\n    const elkEdge: ElkExtendedEdge = {\n      id,\n      sources: [e.src],\n      targets: [e.dst],\n    };\n    if (so === dt) {\n      let list = byCluster.get(so);\n      if (!list) { list = []; byCluster.set(so, list); }\n      list.push(elkEdge);\n    } else {\n      cross.push(elkEdge);\n    }\n  });\n  return { byCluster, cross, edgeIdToKey };\n}\n\n/**\n * Run ELK layout against the C0 graph and return absolute positions.\n *\n * Orphan nodes are wrapped in a synthetic `cluster_orchestrator` so ELK\n * lays them out as a single block alongside the real subnets, which the\n * `rectpacking` root algorithm then packs.\n */\nexport async function elkLayout(graph: GraphModel): Promise<LayoutResult> {\n  const { byCluster, cross, edgeIdToKey } = partitionEdges(graph);\n\n  const elkChildren: ElkNode[] = [];\n  for (const [clusterId, cluster] of graph.clusters) {\n    elkChildren.push({\n      id: clusterId,\n      layoutOptions: CLUSTER_OPTIONS,\n      children: cluster.nodes\n        .map(id => graph.nodes.get(id))\n        .filter((n): n is ParsedNode => n !== undefined)\n        .map(n => ({ id: n.id, ...nodeDims(n) })),\n      edges: byCluster.get(clusterId) ?? [],\n    });\n  }\n  // Synthetic orchestrator cluster holds the remaining orphans\n  elkChildren.push({\n    id: ORCHESTRATOR_CLUSTER_ID,\n    layoutOptions: ORCHESTRATOR_OPTIONS,\n    children: graph.orphans\n      .map(id => graph.nodes.get(id))\n      .filter((n): n is ParsedNode => n !== undefined)\n      .map(n => ({ id: n.id, ...nodeDims(n) })),\n    edges: byCluster.get(ORCHESTRATOR_CLUSTER_ID) ?? [],\n  });\n\n  const elk = new ELK();\n  const rootGraph: ElkNode = {\n    id: 'root',\n    layoutOptions: ROOT_OPTIONS,\n    children: elkChildren,\n    edges: cross,\n  };\n  const layout: ElkNode = await elk.layout(rootGraph);\n\n  const nodePositions = new Map<string, NodePosition>();\n  const clusterBoxes = new Map<string, ClusterBox>();\n  const edgePaths = new Map<string, EdgePath>();\n\n  const walk = (node: ElkNode, parentX: number, parentY: number): void => {\n    const ax = parentX + (node.x ?? 0);\n    const ay = parentY + (node.y ?? 0);\n    const isCluster = node.id !== 'root' && (node.children?.length ?? 0) > 0;\n    if (isCluster) {\n      clusterBoxes.set(node.id, {\n        x: ax, y: ay,\n        width: node.width ?? 0,\n        height: node.height ?? 0,\n      });\n    }\n    if (node.id !== 'root' && !isCluster) {\n      nodePositions.set(node.id, {\n        x: ax, y: ay,\n        width: node.width ?? 0,\n        height: node.height ?? 0,\n      });\n    }\n    // Edges inside this node — their section coords are in the parent's\n    // coordinate frame, so the offset to absolutize is (parentX, parentY)\n    // for root edges, or (ax, ay) for cluster-internal edges.\n    const edgeOffsetX = node.id === 'root' ? parentX : ax;\n    const edgeOffsetY = node.id === 'root' ? parentY : ay;\n    for (const edge of node.edges ?? []) {\n      const key = edge.id ? edgeIdToKey.get(edge.id) : undefined;\n      const section = edge.sections?.[0];\n      if (!key || !section) continue;\n      edgePaths.set(key, {\n        start: {\n          x: edgeOffsetX + section.startPoint.x,\n          y: edgeOffsetY + section.startPoint.y,\n        },\n        end: {\n          x: edgeOffsetX + section.endPoint.x,\n          y: edgeOffsetY + section.endPoint.y,\n        },\n        bends: (section.bendPoints ?? []).map(p => ({\n          x: edgeOffsetX + p.x,\n          y: edgeOffsetY + p.y,\n        })),\n      });\n    }\n    for (const child of node.children ?? []) walk(child, ax, ay);\n  };\n  walk(layout, 0, 0);\n\n  return {\n    nodePositions,\n    clusterBoxes,\n    edgePaths,\n    totalWidth: layout.width ?? 0,\n    totalHeight: layout.height ?? 0,\n  };\n}\n\n/**\n * Escape an attribute value for inclusion in a DOT string literal.\n *\n * Quotes are doubled (per the DOT escape convention `\\\"`).\n */\nfunction quote(value: string): string {\n  return `\"${value.replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"')}\"`;\n}\n\n/**\n * Render a node's attribute list — preserving the parsed attrs (including\n * libpetri's `width`/`height`, which are the *visual* shape dimensions)\n * and adding the ELK-computed `pos` so Graphviz `nop` can pin it.\n *\n * The `pos=\"x,y!\"` form (with trailing `!`) is the neato pin-mode marker.\n * Do NOT emit ELK's layout-reserved width/height to Graphviz — those are\n * the bounding boxes needed for ELK packing (which account for xlabel\n * spillover), not the visible shape sizes. libpetri's standard styles use\n * `width=0.35` for places (25pt circles); overriding with ELK's\n * ~3 inch label-padded box made Graphviz render 114pt-radius circles.\n */\nfunction nodeAttrLine(node: ParsedNode, pos: NodePosition): string {\n  const attrs: string[] = [];\n  // Center the pinned position on the node's bbox (ELK gives the top-left).\n  const cx = pos.x + pos.width / 2;\n  const cy = pos.y + pos.height / 2;\n  attrs.push(`pos=${quote(`${cx.toFixed(2)},${cy.toFixed(2)}!`)}`);\n  for (const [k, v] of Object.entries(node.attrs)) {\n    if (k === 'pos') continue;\n    attrs.push(`${k}=${quote(v)}`);\n  }\n  return `${node.id} [${attrs.join(', ')}];`;\n}\n\nfunction edgeAttrLine(src: string, dst: string, rawAttrs: string): string {\n  // Splice libpetri's original attrs verbatim so style/penwidth/label/color\n  // match `DotExporter` 1:1. We do NOT emit `pos=` for edges — under engine\n  // `nop` Graphviz routes edges itself around the pinned node positions,\n  // which gives proper boundary clipping (arrowheads land at the visual\n  // node edge) and avoids needing a custom polyline-to-spline converter.\n  // The only \"custom\" arrowhead is `arrowhead=\"odot\"` for inhibitor edges,\n  // which libpetri's exporter already writes into rawAttrs.\n  const body = rawAttrs.trim();\n  return `${src} -> ${dst}` + (body ? ` [${body}];` : ';');\n}\n\n/**\n * Emit a Graphviz DOT string with positions pinned. Render the result with\n * `@viz-js/viz` using:\n *\n * ```ts\n * viz.renderSVGElement(dot, {\n *   engine: 'nop',\n *   yInvert: true,\n * });\n * ```\n *\n * `engine: 'nop'` (a.k.a. `nop1`) honours the pinned `pos=` on every node\n * and routes edges around them. We use this rather than `nop2` because\n * `nop2` would force us to provide a spline for every edge ourselves (no\n * routing) — and Graphviz's own routing produces correctly-clipped\n * arrowheads at the visual node boundary, which our ELK polylines did not\n * (ELK uses the layout-reserved bbox, our visual circle is much smaller).\n *\n * `yInvert: true` matches ELK's Y-down convention to Graphviz's Y-up.\n */\nexport function writeBack(graph: GraphModel, layout: LayoutResult): string {\n  const lines: string[] = [];\n  lines.push('digraph LibpetriPinned {');\n  lines.push('    rankdir=TB;');\n  lines.push('    overlap=\"false\";');\n  lines.push('    compound=\"true\";');\n  lines.push('    fontname=\"Helvetica,Arial,sans-serif\";');\n  lines.push('    outputorder=\"edgesfirst\";');\n  lines.push('    node [fontname=\"Helvetica,Arial,sans-serif\", fontsize=10];');\n  lines.push('    edge [fontname=\"Helvetica,Arial,sans-serif\", fontsize=9];');\n\n  // Clusters with their pinned bounding boxes\n  for (const [clusterId, cluster] of graph.clusters) {\n    const box = layout.clusterBoxes.get(clusterId);\n    lines.push(`    subgraph ${clusterId} {`);\n    lines.push(`        label=${quote(cluster.shortName)};`);\n    lines.push(`        style=\"rounded,dashed\";`);\n    lines.push(`        bgcolor=\"#FAFAFA\";`);\n    lines.push(`        penwidth=1.5;`);\n    if (box) {\n      const x1 = box.x.toFixed(2);\n      const y1 = box.y.toFixed(2);\n      const x2 = (box.x + box.width).toFixed(2);\n      const y2 = (box.y + box.height).toFixed(2);\n      lines.push(`        bb=${quote(`${x1},${y1},${x2},${y2}`)};`);\n    }\n    for (const nodeId of cluster.nodes) {\n      const node = graph.nodes.get(nodeId);\n      const pos = layout.nodePositions.get(nodeId);\n      if (!node || !pos) continue;\n      lines.push('        ' + nodeAttrLine(node, pos));\n    }\n    lines.push('    }');\n  }\n\n  // Orphans (root-level nodes) — laid out inside the synthetic\n  // orchestrator cluster but emitted at root so they sit alongside the\n  // real subnets without their own labelled box.\n  for (const orphanId of graph.orphans) {\n    const node = graph.nodes.get(orphanId);\n    const pos = layout.nodePositions.get(orphanId);\n    if (!node || !pos) continue;\n    lines.push('    ' + nodeAttrLine(node, pos));\n  }\n\n  // Edges — emit just the source -> dest pair plus libpetri's original\n  // styling attrs. Graphviz `nop` routes the line itself and clips arrow\n  // heads to the visual node boundary.\n  for (const edge of graph.edges) {\n    lines.push('    ' + edgeAttrLine(edge.src, edge.dst, edge.rawAttrs));\n  }\n\n  lines.push('}');\n  return lines.join('\\n');\n}\n"],"mappings":";AAkEA,SAAS,aAAa,IAAsB;AAC1C,MAAI,GAAG,WAAW,IAAI,EAAG,QAAO;AAChC,MAAI,GAAG,WAAW,IAAI,EAAG,QAAO;AAChC,SAAO;AACT;AAQA,SAAS,WAAW,MAAsC;AACxD,QAAM,QAAgC,CAAC;AACvC,aAAW,KAAK,KAAK,SAAS,0CAA0C,GAAG;AACzE,UAAM,CAAC,EAAE,KAAK,GAAG,IAAI;AACrB,UAAM,IAAI,IAAI,WAAW,GAAG,KAAK,IAAI,SAAS,GAAG,IAAI,IAAI,MAAM,GAAG,EAAE,IAAI;AACxE,UAAM,GAAG,IAAI;AAAA,EACf;AACA,SAAO;AACT;AAaO,SAAS,iBAAiB,KAAyB;AACxD,QAAM,QAAQ,oBAAI,IAAwB;AAM1C,aAAW,KAAK,IAAI,SAAS,6CAA6C,GAAG;AAC3E,UAAM,CAAC,EAAE,IAAI,IAAI,IAAI;AACrB,UAAM,IAAI,IAAI,EAAE,IAAI,MAAM,aAAa,EAAE,GAAG,OAAO,WAAW,IAAI,EAAE,CAAC;AAAA,EACvE;AAEA,QAAM,WAAW,oBAAI,IAA2B;AAChD,QAAM,gBAAgB,oBAAI,IAAoB;AAC9C,aAAW,MAAM,IAAI,SAAS,4CAA4C,GAAG;AAC3E,UAAM,CAAC,EAAE,WAAW,IAAI,IAAI;AAC5B,UAAM,YAAY,CAAC,GAAG,KAAK,SAAS,kCAAkC,CAAC,EACpE,IAAI,OAAM,EAAkC,CAAC,CAAC;AACjD,aAAS,IAAI,WAAW;AAAA,MACtB,IAAI;AAAA,MACJ,WAAW,UAAU,QAAQ,aAAa,EAAE;AAAA,MAC5C,OAAO;AAAA,IACT,CAAC;AACD,eAAW,KAAK,UAAW,eAAc,IAAI,GAAG,SAAS;AAAA,EAC3D;AAGA,QAAM,WAAW,IAAI,QAAQ,0CAA0C,EAAE;AACzE,aAAW,KAAK,SAAS,SAAS,kCAAkC,GAAG;AACrE,UAAM,KAAM,EAAkC,CAAC;AAC/C,QAAI,CAAC,MAAM,IAAI,EAAE,GAAG;AAElB,YAAM,IAAI,IAAI,EAAE,IAAI,MAAM,aAAa,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC;AAAA,IACzD;AAAA,EACF;AAEA,QAAM,UAAU,CAAC,GAAG,MAAM,KAAK,CAAC,EAAE,OAAO,OAAK,CAAC,cAAc,IAAI,CAAC,CAAC;AAEnE,QAAM,QAAsB,CAAC;AAC7B,aAAW,KAAK,IAAI,SAAS,qEAAqE,GAAG;AACnG,UAAM,CAAC,EAAE,KAAK,KAAK,QAAQ,IAAI;AAC/B,UAAM,QAAQ,YAAY;AAG1B,QAAI,MAAM,SAAS,QAAQ,KAAK,MAAM,SAAS,QAAQ,EAAG;AAC1D,QAAI,MAAe;AACnB,QAAI,MAAM,SAAS,eAAe,KAAK,MAAM,SAAS,SAAS,EAAG,OAAM;AAAA,aAC/D,MAAM,SAAS,kBAAkB,KAAK,MAAM,SAAS,SAAS,EAAG,OAAM;AAAA,aACvE,MAAM,SAAS,cAAc,EAAG,OAAM;AAG/C,UAAMA,YAAW,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,IACxD,MAAM,MAAM,GAAG,EAAE,IACjB;AACJ,UAAM,KAAK,EAAE,KAAK,KAAK,KAAK,UAAUA,UAAS,CAAC;AAAA,EAClD;AAEA,SAAO,EAAE,OAAO,UAAU,eAAe,SAAS,MAAM;AAC1D;AAWO,SAAS,YAAY,OAAmB,YAAY,KAAiB;AAC1E,MAAI,aAAa,EAAG,QAAO;AAE3B,QAAM,gBAAgB,IAAI,IAAI,MAAM,aAAa;AACjD,QAAM,iBAAiB,oBAAI,IAAsB;AACjD,aAAW,CAAC,IAAI,CAAC,KAAK,MAAM,SAAU,gBAAe,IAAI,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC;AAEzE,QAAM,QAAQ,oBAAI,IAAiC;AACnD,QAAM,OAAO,CAAC,QAAgB,UAAwB;AACpD,UAAM,KAAK,cAAc,IAAI,KAAK;AAClC,QAAI,CAAC,GAAI;AACT,QAAI,IAAI,MAAM,IAAI,MAAM;AACxB,QAAI,CAAC,GAAG;AAAE,UAAI,oBAAI,IAAI;AAAG,YAAM,IAAI,QAAQ,CAAC;AAAA,IAAG;AAC/C,MAAE,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,CAAC;AAAA,EAChC;AAEA,aAAW,KAAK,MAAM,OAAO;AAC3B,UAAM,YAAY,CAAC,cAAc,IAAI,EAAE,GAAG;AAC1C,UAAM,YAAY,CAAC,cAAc,IAAI,EAAE,GAAG;AAC1C,QAAI,aAAa,CAAC,UAAW,MAAK,EAAE,KAAK,EAAE,GAAG;AAC9C,QAAI,aAAa,CAAC,UAAW,MAAK,EAAE,KAAK,EAAE,GAAG;AAAA,EAChD;AAEA,aAAW,MAAM,MAAM,SAAS;AAC9B,UAAM,IAAI,MAAM,IAAI,EAAE;AACtB,QAAI,CAAC,EAAG;AACR,QAAI,QAAQ;AACZ,QAAI,cAA6B;AACjC,QAAI,YAAY;AAChB,eAAW,CAAC,GAAG,CAAC,KAAK,GAAG;AACtB,eAAS;AACT,UAAI,IAAI,WAAW;AAAE,oBAAY;AAAG,sBAAc;AAAA,MAAG;AAAA,IACvD;AACA,QAAI,eAAe,QAAQ,KAAK,YAAY,SAAS,WAAW;AAC9D,qBAAe,IAAI,WAAW,EAAG,KAAK,EAAE;AACxC,oBAAc,IAAI,IAAI,WAAW;AAAA,IACnC;AAAA,EACF;AAEA,QAAM,WAAW,oBAAI,IAA2B;AAChD,aAAW,CAAC,IAAI,CAAC,KAAK,MAAM,UAAU;AACpC,aAAS,IAAI,IAAI,EAAE,GAAG,GAAG,OAAO,eAAe,IAAI,EAAE,EAAG,CAAC;AAAA,EAC3D;AACA,QAAM,UAAU,CAAC,GAAG,MAAM,MAAM,KAAK,CAAC,EAAE,OAAO,OAAK,CAAC,cAAc,IAAI,CAAC,CAAC;AACzE,SAAO,EAAE,GAAG,OAAO,UAAU,eAAe,QAAQ;AACtD;AAiCO,SAAS,gBACd,OACA,OAAyB,CAAC,GACgC;AAC1D,QAAM,MAAM,KAAK,OAAO;AACxB,QAAM,uBAAuB,KAAK,wBAAwB;AAE1D,QAAM,QAAQ,IAAI,IAAI,MAAM,KAAK;AACjC,QAAM,gBAAgB,IAAI,IAAI,MAAM,aAAa;AACjD,QAAM,iBAAiB,oBAAI,IAAsB;AACjD,aAAW,CAAC,IAAI,CAAC,KAAK,MAAM,SAAU,gBAAe,IAAI,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC;AACzE,QAAM,QAAQ,MAAM,MAAM,IAAI,QAAM,EAAE,GAAG,EAAE,EAAE;AAG7C,QAAM,gBAAgB,oBAAI,IAAyB;AACnD,QAAM,cAAc,CAAC,QAAgB,YAA0B;AAC7D,QAAI,CAAC,OAAO,WAAW,IAAI,KAAK,EAAE,wBAAwB,OAAO,WAAW,IAAI,GAAI;AACpF,UAAM,OAAO,cAAc,IAAI,MAAM;AACrC,UAAM,eAAe,cAAc,IAAI,OAAO;AAC9C,QAAI,CAAC,aAAc;AACnB,QAAI,iBAAiB,KAAM;AAC3B,QAAI,IAAI,cAAc,IAAI,MAAM;AAChC,QAAI,CAAC,GAAG;AAAE,UAAI,oBAAI,IAAI;AAAG,oBAAc,IAAI,QAAQ,CAAC;AAAA,IAAG;AACvD,MAAE,IAAI,YAAY;AAAA,EACpB;AACA,aAAW,KAAK,OAAO;AACrB,gBAAY,EAAE,KAAK,EAAE,GAAG;AACxB,gBAAY,EAAE,KAAK,EAAE,GAAG;AAAA,EAC1B;AAGA,QAAM,aAAa,oBAAI,IAAiC;AACxD,MAAI,mBAAmB;AACvB,MAAI,cAAc;AAClB,aAAW,CAAC,SAAS,QAAQ,KAAK,eAAe;AAC/C,QAAI,SAAS,SAAS,EAAG;AACzB,QAAI,SAAS,OAAO,IAAK;AACzB,UAAM,aAAa,oBAAI,IAAoB;AAC3C,UAAM,OAAO,MAAM,IAAI,OAAO;AAC9B,QAAI,CAAC,KAAM;AACX,eAAW,aAAa,UAAU;AAChC,YAAM,YAAY,UAAU,QAAQ,aAAa,EAAE;AACnD,YAAM,QAAQ,GAAG,OAAO,UAAU,SAAS;AAC3C,iBAAW,IAAI,WAAW,KAAK;AAC/B,qBAAe,IAAI,SAAS,EAAG,KAAK,KAAK;AACzC,oBAAc,IAAI,OAAO,SAAS;AAClC,YAAM,IAAI,OAAO;AAAA,QACf,IAAI;AAAA,QACJ,MAAM,KAAK;AAAA,QACX,OAAO,EAAE,GAAG,KAAK,MAAM;AAAA,QACvB,SAAS;AAAA,QACT,WAAW;AAAA,MACb,CAAC;AACD;AAAA,IACF;AACA,eAAW,IAAI,SAAS,UAAU;AAClC;AAEA,UAAM,IAAI,SAAS,EAAE,GAAG,MAAM,SAAS,MAAM,WAAW,QAAQ,CAAC;AAAA,EACnE;AAGA,aAAW,KAAK,OAAO;AACrB,UAAM,OAAO,WAAW,IAAI,EAAE,GAAG;AACjC,UAAM,OAAO,WAAW,IAAI,EAAE,GAAG;AACjC,QAAI,MAAM;AACR,YAAM,MAAM,cAAc,IAAI,EAAE,GAAG;AACnC,UAAI,OAAO,KAAK,IAAI,GAAG,EAAG,GAAE,MAAM,KAAK,IAAI,GAAG;AAAA,IAChD;AACA,QAAI,MAAM;AACR,YAAM,MAAM,cAAc,IAAI,EAAE,GAAG;AACnC,UAAI,OAAO,KAAK,IAAI,GAAG,EAAG,GAAE,MAAM,KAAK,IAAI,GAAG;AAAA,IAChD;AAAA,EACF;AAGA,aAAW,CAAC,MAAM,KAAK,YAAY;AACjC,QAAI,cAAc,IAAI,MAAM,EAAG;AAC/B,UAAM,eAAe,MAAM,KAAK,OAAK,EAAE,QAAQ,UAAU,EAAE,QAAQ,MAAM;AACzE,QAAI,CAAC,aAAc,OAAM,OAAO,MAAM;AAAA,EACxC;AAEA,QAAM,WAAW,oBAAI,IAA2B;AAChD,aAAW,CAAC,IAAI,CAAC,KAAK,MAAM,UAAU;AACpC,aAAS,IAAI,IAAI,EAAE,GAAG,GAAG,OAAO,eAAe,IAAI,EAAE,EAAG,CAAC;AAAA,EAC3D;AACA,QAAM,UAAU,CAAC,GAAG,MAAM,KAAK,CAAC,EAAE,OAAO,OAAK,CAAC,cAAc,IAAI,CAAC,CAAC;AAEnE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,gBAAgB,EAAE,kBAAkB,YAAY;AAAA,EAClD;AACF;;;AClUA,OAAO,SAAS;AAOhB,IAAM,0BAA0B;AAIhC,IAAM,eAAe;AACrB,IAAM,cAAc;AACpB,IAAM,kBAAkB;AACxB,IAAM,aAAa;AACnB,IAAM,mBAAmB;AACzB,IAAM,eAAe;AACrB,IAAM,mBAAmB;AACzB,IAAM,gBAAgB;AACtB,IAAM,eAAe;AACrB,IAAM,eAAe;AACrB,IAAM,kBAAkB;AAOxB,SAAS,SAAS,MAAqD;AACrE,MAAI,KAAK,SAAS,SAAS;AACzB,UAAMC,UAAS,KAAK,MAAM,UAAU,KAAK,MAAM,SAAS,KAAK,IAAI,QAAQ,QAAQ,GAAG;AACpF,UAAM,aAAaA,OAAM,SAAS;AAClC,UAAM,UAAU,eAAe,IAAI;AACnC,WAAO;AAAA,MACL,OAAO,KAAK,IAAI,SAAS,UAAU;AAAA,MACnC,QAAQ,UAAU,kBAAkB;AAAA,IACtC;AAAA,EACF;AACA,MAAI,KAAK,SAAS,YAAY;AAC5B,WAAO,EAAE,OAAO,eAAe,QAAQ,cAAc;AAAA,EACvD;AACA,QAAM,SAAS,KAAK,MAAM,SAAS,KAAK,IAAI,QAAQ,QAAQ,GAAG;AAC/D,SAAO;AAAA,IACL,OAAO,KAAK,IAAI,kBAAkB,MAAM,SAAS,gBAAgB;AAAA,IACjE,QAAQ;AAAA,EACV;AACF;AA+BA,IAAM,kBAA0C;AAAA,EAC9C,eAAe,QAAQ,eAAe,EAAE;AAAA,EACxC,iBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,wBAAwB,OAAO,eAAe;AAAA,EAC9C,6CAA6C,OAAO,kBAAkB,CAAC;AAAA,EACvE,mBAAmB;AACrB;AAEA,IAAM,eAAuC;AAAA,EAC3C,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,eAAe;AAAA,EACf,wBAAwB,OAAO,YAAY;AAC7C;AAEA,IAAM,uBAA+C;AAAA,EACnD,GAAG;AAAA,EACH,mBAAmB;AAAA,EACnB,wBAAwB;AAC1B;AASA,SAAS,eAAe,OAKtB;AACA,QAAM,YAAY,oBAAI,IAA+B;AACrD,QAAM,QAA2B,CAAC;AAClC,QAAM,cAAc,oBAAI,IAAoB;AAC5C,QAAM,UAAU,CAAC,OACf,MAAM,cAAc,IAAI,EAAE,KAAK;AAEjC,QAAM,MAAM,QAAQ,CAAC,GAAG,MAAM;AAC5B,UAAM,KAAK,QAAQ,EAAE,GAAG;AACxB,UAAM,KAAK,QAAQ,EAAE,GAAG;AACxB,UAAM,KAAK,IAAI,CAAC;AAChB,gBAAY,IAAI,IAAI,GAAG,EAAE,GAAG,KAAK,EAAE,GAAG,EAAE;AACxC,UAAM,UAA2B;AAAA,MAC/B;AAAA,MACA,SAAS,CAAC,EAAE,GAAG;AAAA,MACf,SAAS,CAAC,EAAE,GAAG;AAAA,IACjB;AACA,QAAI,OAAO,IAAI;AACb,UAAI,OAAO,UAAU,IAAI,EAAE;AAC3B,UAAI,CAAC,MAAM;AAAE,eAAO,CAAC;AAAG,kBAAU,IAAI,IAAI,IAAI;AAAA,MAAG;AACjD,WAAK,KAAK,OAAO;AAAA,IACnB,OAAO;AACL,YAAM,KAAK,OAAO;AAAA,IACpB;AAAA,EACF,CAAC;AACD,SAAO,EAAE,WAAW,OAAO,YAAY;AACzC;AASA,eAAsB,UAAU,OAA0C;AACxE,QAAM,EAAE,WAAW,OAAO,YAAY,IAAI,eAAe,KAAK;AAE9D,QAAM,cAAyB,CAAC;AAChC,aAAW,CAAC,WAAW,OAAO,KAAK,MAAM,UAAU;AACjD,gBAAY,KAAK;AAAA,MACf,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,UAAU,QAAQ,MACf,IAAI,QAAM,MAAM,MAAM,IAAI,EAAE,CAAC,EAC7B,OAAO,CAAC,MAAuB,MAAM,MAAS,EAC9C,IAAI,QAAM,EAAE,IAAI,EAAE,IAAI,GAAG,SAAS,CAAC,EAAE,EAAE;AAAA,MAC1C,OAAO,UAAU,IAAI,SAAS,KAAK,CAAC;AAAA,IACtC,CAAC;AAAA,EACH;AAEA,cAAY,KAAK;AAAA,IACf,IAAI;AAAA,IACJ,eAAe;AAAA,IACf,UAAU,MAAM,QACb,IAAI,QAAM,MAAM,MAAM,IAAI,EAAE,CAAC,EAC7B,OAAO,CAAC,MAAuB,MAAM,MAAS,EAC9C,IAAI,QAAM,EAAE,IAAI,EAAE,IAAI,GAAG,SAAS,CAAC,EAAE,EAAE;AAAA,IAC1C,OAAO,UAAU,IAAI,uBAAuB,KAAK,CAAC;AAAA,EACpD,CAAC;AAED,QAAM,MAAM,IAAI,IAAI;AACpB,QAAM,YAAqB;AAAA,IACzB,IAAI;AAAA,IACJ,eAAe;AAAA,IACf,UAAU;AAAA,IACV,OAAO;AAAA,EACT;AACA,QAAM,SAAkB,MAAM,IAAI,OAAO,SAAS;AAElD,QAAM,gBAAgB,oBAAI,IAA0B;AACpD,QAAM,eAAe,oBAAI,IAAwB;AACjD,QAAM,YAAY,oBAAI,IAAsB;AAE5C,QAAM,OAAO,CAAC,MAAe,SAAiB,YAA0B;AACtE,UAAM,KAAK,WAAW,KAAK,KAAK;AAChC,UAAM,KAAK,WAAW,KAAK,KAAK;AAChC,UAAM,YAAY,KAAK,OAAO,WAAW,KAAK,UAAU,UAAU,KAAK;AACvE,QAAI,WAAW;AACb,mBAAa,IAAI,KAAK,IAAI;AAAA,QACxB,GAAG;AAAA,QAAI,GAAG;AAAA,QACV,OAAO,KAAK,SAAS;AAAA,QACrB,QAAQ,KAAK,UAAU;AAAA,MACzB,CAAC;AAAA,IACH;AACA,QAAI,KAAK,OAAO,UAAU,CAAC,WAAW;AACpC,oBAAc,IAAI,KAAK,IAAI;AAAA,QACzB,GAAG;AAAA,QAAI,GAAG;AAAA,QACV,OAAO,KAAK,SAAS;AAAA,QACrB,QAAQ,KAAK,UAAU;AAAA,MACzB,CAAC;AAAA,IACH;AAIA,UAAM,cAAc,KAAK,OAAO,SAAS,UAAU;AACnD,UAAM,cAAc,KAAK,OAAO,SAAS,UAAU;AACnD,eAAW,QAAQ,KAAK,SAAS,CAAC,GAAG;AACnC,YAAM,MAAM,KAAK,KAAK,YAAY,IAAI,KAAK,EAAE,IAAI;AACjD,YAAM,UAAU,KAAK,WAAW,CAAC;AACjC,UAAI,CAAC,OAAO,CAAC,QAAS;AACtB,gBAAU,IAAI,KAAK;AAAA,QACjB,OAAO;AAAA,UACL,GAAG,cAAc,QAAQ,WAAW;AAAA,UACpC,GAAG,cAAc,QAAQ,WAAW;AAAA,QACtC;AAAA,QACA,KAAK;AAAA,UACH,GAAG,cAAc,QAAQ,SAAS;AAAA,UAClC,GAAG,cAAc,QAAQ,SAAS;AAAA,QACpC;AAAA,QACA,QAAQ,QAAQ,cAAc,CAAC,GAAG,IAAI,QAAM;AAAA,UAC1C,GAAG,cAAc,EAAE;AAAA,UACnB,GAAG,cAAc,EAAE;AAAA,QACrB,EAAE;AAAA,MACJ,CAAC;AAAA,IACH;AACA,eAAW,SAAS,KAAK,YAAY,CAAC,EAAG,MAAK,OAAO,IAAI,EAAE;AAAA,EAC7D;AACA,OAAK,QAAQ,GAAG,CAAC;AAEjB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY,OAAO,SAAS;AAAA,IAC5B,aAAa,OAAO,UAAU;AAAA,EAChC;AACF;AAOA,SAAS,MAAM,OAAuB;AACpC,SAAO,IAAI,MAAM,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK,CAAC;AAC9D;AAcA,SAAS,aAAa,MAAkB,KAA2B;AACjE,QAAM,QAAkB,CAAC;AAEzB,QAAM,KAAK,IAAI,IAAI,IAAI,QAAQ;AAC/B,QAAM,KAAK,IAAI,IAAI,IAAI,SAAS;AAChC,QAAM,KAAK,OAAO,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE;AAC/D,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AAC/C,QAAI,MAAM,MAAO;AACjB,UAAM,KAAK,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,EAAE;AAAA,EAC/B;AACA,SAAO,GAAG,KAAK,EAAE,KAAK,MAAM,KAAK,IAAI,CAAC;AACxC;AAEA,SAAS,aAAa,KAAa,KAAa,UAA0B;AAQxE,QAAM,OAAO,SAAS,KAAK;AAC3B,SAAO,GAAG,GAAG,OAAO,GAAG,MAAM,OAAO,KAAK,IAAI,OAAO;AACtD;AAsBO,SAAS,UAAU,OAAmB,QAA8B;AACzE,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,0BAA0B;AACrC,QAAM,KAAK,iBAAiB;AAC5B,QAAM,KAAK,sBAAsB;AACjC,QAAM,KAAK,sBAAsB;AACjC,QAAM,KAAK,4CAA4C;AACvD,QAAM,KAAK,+BAA+B;AAC1C,QAAM,KAAK,gEAAgE;AAC3E,QAAM,KAAK,+DAA+D;AAG1E,aAAW,CAAC,WAAW,OAAO,KAAK,MAAM,UAAU;AACjD,UAAM,MAAM,OAAO,aAAa,IAAI,SAAS;AAC7C,UAAM,KAAK,gBAAgB,SAAS,IAAI;AACxC,UAAM,KAAK,iBAAiB,MAAM,QAAQ,SAAS,CAAC,GAAG;AACvD,UAAM,KAAK,iCAAiC;AAC5C,UAAM,KAAK,4BAA4B;AACvC,UAAM,KAAK,uBAAuB;AAClC,QAAI,KAAK;AACP,YAAM,KAAK,IAAI,EAAE,QAAQ,CAAC;AAC1B,YAAM,KAAK,IAAI,EAAE,QAAQ,CAAC;AAC1B,YAAM,MAAM,IAAI,IAAI,IAAI,OAAO,QAAQ,CAAC;AACxC,YAAM,MAAM,IAAI,IAAI,IAAI,QAAQ,QAAQ,CAAC;AACzC,YAAM,KAAK,cAAc,MAAM,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG;AAAA,IAC9D;AACA,eAAW,UAAU,QAAQ,OAAO;AAClC,YAAM,OAAO,MAAM,MAAM,IAAI,MAAM;AACnC,YAAM,MAAM,OAAO,cAAc,IAAI,MAAM;AAC3C,UAAI,CAAC,QAAQ,CAAC,IAAK;AACnB,YAAM,KAAK,aAAa,aAAa,MAAM,GAAG,CAAC;AAAA,IACjD;AACA,UAAM,KAAK,OAAO;AAAA,EACpB;AAKA,aAAW,YAAY,MAAM,SAAS;AACpC,UAAM,OAAO,MAAM,MAAM,IAAI,QAAQ;AACrC,UAAM,MAAM,OAAO,cAAc,IAAI,QAAQ;AAC7C,QAAI,CAAC,QAAQ,CAAC,IAAK;AACnB,UAAM,KAAK,SAAS,aAAa,MAAM,GAAG,CAAC;AAAA,EAC7C;AAKA,aAAW,QAAQ,MAAM,OAAO;AAC9B,UAAM,KAAK,SAAS,aAAa,KAAK,KAAK,KAAK,KAAK,KAAK,QAAQ,CAAC;AAAA,EACrE;AAEA,QAAM,KAAK,GAAG;AACd,SAAO,MAAM,KAAK,IAAI;AACxB;","names":["stripped","label"]}

package/dist/chunk-SXK2Z45Z.js

@@ -0,0 +1,50 @@
+// src/event/net-event.ts
+function eventTransitionName(event) {
+  switch (event.type) {
+    case "transition-enabled":
+    case "transition-clock-restarted":
+    case "transition-started":
+    case "transition-completed":
+    case "transition-failed":
+    case "transition-timed-out":
+    case "action-timed-out":
+    case "log-message":
+      return event.transitionName;
+    default:
+      return null;
+  }
+}
+function instancePrefixOfName(name) {
+  if (name == null) return void 0;
+  const idx = name.lastIndexOf("/");
+  if (idx <= 0) return void 0;
+  return name.substring(0, idx);
+}
+function eventInstancePrefix(event) {
+  switch (event.type) {
+    case "transition-enabled":
+    case "transition-clock-restarted":
+    case "transition-started":
+    case "transition-completed":
+    case "transition-failed":
+    case "transition-timed-out":
+    case "action-timed-out":
+    case "log-message":
+      return instancePrefixOfName(event.transitionName);
+    case "token-added":
+    case "token-removed":
+      return instancePrefixOfName(event.placeName);
+    default:
+      return void 0;
+  }
+}
+function isFailureEvent(event) {
+  return event.type === "transition-failed" || event.type === "transition-timed-out" || event.type === "action-timed-out";
+}
+
+export {
+  eventTransitionName,
+  eventInstancePrefix,
+  isFailureEvent
+};
+//# sourceMappingURL=chunk-SXK2Z45Z.js.map

package/dist/chunk-SXK2Z45Z.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/event/net-event.ts"],"sourcesContent":["import type { Token } from '../core/token.js';\n\n/**\n * Events emitted during Petri Net execution.\n * Discriminated union capturing all observable state changes.\n */\nexport type NetEvent =\n  | ExecutionStarted\n  | ExecutionCompleted\n  | TransitionEnabled\n  | TransitionClockRestarted\n  | TransitionStarted\n  | TransitionCompleted\n  | TransitionFailed\n  | TransitionTimedOut\n  | ActionTimedOut\n  | TokenAdded\n  | TokenRemoved\n  | LogMessage\n  | MarkingSnapshot;\n\n// ======================== Execution Lifecycle ========================\n\nexport interface ExecutionStarted {\n  readonly type: 'execution-started';\n  readonly timestamp: number;\n  readonly netName: string;\n  readonly executionId: string;\n}\n\nexport interface ExecutionCompleted {\n  readonly type: 'execution-completed';\n  readonly timestamp: number;\n  readonly netName: string;\n  readonly executionId: string;\n  readonly totalDurationMs: number;\n}\n\n// ======================== Transition Lifecycle ========================\n\nexport interface TransitionEnabled {\n  readonly type: 'transition-enabled';\n  readonly timestamp: number;\n  readonly transitionName: string;\n}\n\nexport interface TransitionClockRestarted {\n  readonly type: 'transition-clock-restarted';\n  readonly timestamp: number;\n  readonly transitionName: string;\n}\n\nexport interface TransitionStarted {\n  readonly type: 'transition-started';\n  readonly timestamp: number;\n  readonly transitionName: string;\n  readonly consumedTokens: readonly Token<unknown>[];\n}\n\nexport interface TransitionCompleted {\n  readonly type: 'transition-completed';\n  readonly timestamp: number;\n  readonly transitionName: string;\n  readonly producedTokens: readonly Token<unknown>[];\n  readonly durationMs: number;\n}\n\nexport interface TransitionFailed {\n  readonly type: 'transition-failed';\n  readonly timestamp: number;\n  readonly transitionName: string;\n  readonly errorMessage: string;\n  readonly exceptionType: string;\n  /** Original stack trace, if available. */\n  readonly stack?: string;\n}\n\n/**\n * Emitted when a transition exceeds its deadline (upper time bound) without firing.\n * Classical TPN semantics: transition is forcibly disabled by the executor in\n * `updateDirtyTransitions()` when elapsed time exceeds `latest(timing)`.\n */\nexport interface TransitionTimedOut {\n  readonly type: 'transition-timed-out';\n  readonly timestamp: number;\n  readonly transitionName: string;\n  /** The deadline that was exceeded, in milliseconds from enablement. */\n  readonly deadlineMs: number;\n  /** Actual time elapsed since enablement, in milliseconds. */\n  readonly actualDurationMs: number;\n}\n\nexport interface ActionTimedOut {\n  readonly type: 'action-timed-out';\n  readonly timestamp: number;\n  readonly transitionName: string;\n  readonly timeoutMs: number;\n}\n\n// ======================== Token Movement ========================\n\nexport interface TokenAdded {\n  readonly type: 'token-added';\n  readonly timestamp: number;\n  readonly placeName: string;\n  readonly token: Token<unknown>;\n}\n\nexport interface TokenRemoved {\n  readonly type: 'token-removed';\n  readonly timestamp: number;\n  readonly placeName: string;\n  readonly token: Token<unknown>;\n}\n\n// ======================== Log Capture ========================\n\nexport interface LogMessage {\n  readonly type: 'log-message';\n  readonly timestamp: number;\n  readonly transitionName: string;\n  readonly logger: string;\n  readonly level: string;\n  readonly message: string;\n  readonly error: string | null;\n  readonly errorMessage: string | null;\n}\n\n// ======================== Checkpointing ========================\n\n/**\n * Snapshot of the full marking (token state) at a point in time.\n * Emitted at two points during execution:\n * 1. After initialization (before the main loop) — captures the initial marking\n * 2. Before the execution-completed event — captures the final marking\n */\nexport interface MarkingSnapshot {\n  readonly type: 'marking-snapshot';\n  readonly timestamp: number;\n  /** Place name -> tokens in that place at snapshot time. Only non-empty places are included. */\n  readonly marking: ReadonlyMap<string, readonly Token<unknown>[]>;\n}\n\n// ======================== Helper Functions ========================\n\n/** Extracts transition name from events that have one. Returns null otherwise. */\nexport function eventTransitionName(event: NetEvent): string | null {\n  switch (event.type) {\n    case 'transition-enabled':\n    case 'transition-clock-restarted':\n    case 'transition-started':\n    case 'transition-completed':\n    case 'transition-failed':\n    case 'transition-timed-out':\n    case 'action-timed-out':\n    case 'log-message':\n      return event.transitionName;\n    default:\n      return null;\n  }\n}\n\n/**\n * Returns the instance prefix derived from a place or transition name per\n * `spec/11-modular-composition.md` **MOD-041**: the substring before the\n * **last** `/`, or `undefined` when the name is not part of any composed\n * subnet instance (no `/`).\n *\n * This helper is duplicated inside the event package (rather than delegated\n * to {@link import('../export/subnet-prefixes.js')}) to keep the event\n * subsystem dependency-free of the export layer per the package-isolation\n * contract.\n *\n * @param name place or transition name (may be `null` / `undefined`)\n * @returns derived instance prefix, or `undefined`\n */\nexport function instancePrefixOfName(name: string | null | undefined): string | undefined {\n  if (name == null) return undefined;\n  const idx = name.lastIndexOf('/');\n  if (idx <= 0) return undefined;\n  return name.substring(0, idx);\n}\n\n/**\n * Derived instance prefix per **MOD-041** for any {@link NetEvent} that\n * names a transition or a place. Returns `undefined` for execution lifecycle\n * events and marking snapshots (which do not carry a single\n * transition/place name) and for events whose name has no `/`.\n *\n * Mirrors the per-record `instancePrefix()` getter on the Java\n * {@code NetEvent} sealed hierarchy.\n */\nexport function eventInstancePrefix(event: NetEvent): string | undefined {\n  switch (event.type) {\n    case 'transition-enabled':\n    case 'transition-clock-restarted':\n    case 'transition-started':\n    case 'transition-completed':\n    case 'transition-failed':\n    case 'transition-timed-out':\n    case 'action-timed-out':\n    case 'log-message':\n      return instancePrefixOfName(event.transitionName);\n    case 'token-added':\n    case 'token-removed':\n      return instancePrefixOfName(event.placeName);\n    default:\n      return undefined;\n  }\n}\n\n/** Checks if the event is a failure type. */\nexport function isFailureEvent(event: NetEvent): boolean {\n  return event.type === 'transition-failed'\n    || event.type === 'transition-timed-out'\n    || event.type === 'action-timed-out';\n}\n"],"mappings":";AAkJO,SAAS,oBAAoB,OAAgC;AAClE,UAAQ,MAAM,MAAM;AAAA,IAClB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,MAAM;AAAA,IACf;AACE,aAAO;AAAA,EACX;AACF;AAgBO,SAAS,qBAAqB,MAAqD;AACxF,MAAI,QAAQ,KAAM,QAAO;AACzB,QAAM,MAAM,KAAK,YAAY,GAAG;AAChC,MAAI,OAAO,EAAG,QAAO;AACrB,SAAO,KAAK,UAAU,GAAG,GAAG;AAC9B;AAWO,SAAS,oBAAoB,OAAqC;AACvE,UAAQ,MAAM,MAAM;AAAA,IAClB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,qBAAqB,MAAM,cAAc;AAAA,IAClD,KAAK;AAAA,IACL,KAAK;AACH,aAAO,qBAAqB,MAAM,SAAS;AAAA,IAC7C;AACE,aAAO;AAAA,EACX;AACF;AAGO,SAAS,eAAe,OAA0B;AACvD,SAAO,MAAM,SAAS,uBACjB,MAAM,SAAS,0BACf,MAAM,SAAS;AACtB;","names":[]}

package/dist/debug/index.d.ts

@@ -1,6 +1,6 @@
 import { Writable } from 'node:stream';
-import { a as PetriNet, b as Transition, T as Token } from '../petri-net-D-GN9g_D.js';
-import { E as EventStore, N as NetEvent } from '../event-store-BnyHh3TF.js';
+import { P as PetriNet, b as Transition, T as Token } from '../petri-net-BDrj4XZE.js';
+import { E as EventStore, N as NetEvent } from '../event-store-2zkXeQkd.js';
 
 /**
  * Commands sent from debug UI client to server via WebSocket.
@@ -135,15 +135,49 @@ interface PlaceInfo {
     readonly isStart: boolean;
     readonly isEnd: boolean;
     readonly isEnvironment: boolean;
+    /**
+     * Derived instance prefix per `spec/11-modular-composition.md` **MOD-041**:
+     * the substring before the last `/` of {@link name}, omitted entirely from
+     * the wire when the place is not part of any composed instance.
+     */
+    readonly instancePrefix?: string;
 }
 interface TransitionInfo {
     readonly name: string;
     readonly graphId: string;
+    /**
+     * Derived instance prefix per `spec/11-modular-composition.md` **MOD-041**:
+     * the substring before the last `/` of {@link name}, omitted entirely from
+     * the wire when the transition is not part of any composed instance.
+     */
+    readonly instancePrefix?: string;
 }
 interface NetStructure {
     readonly places: readonly PlaceInfo[];
     readonly transitions: readonly TransitionInfo[];
 }
+/**
+ * Wire-facing descriptor of one composed subnet instance per
+ * `spec/11-modular-composition.md` **MOD-041**.
+ *
+ * Mirrors {@code SubnetInstanceInfo} in Java: carries **names** instead of
+ * object references so the JSON shape stays simple. {@link parentPrefix} is
+ * absent (omitted from the wire) for top-level instances. {@link defName} is
+ * absent in v1 — the runtime does not track {@code SubnetDef} provenance
+ * once composition has flattened the topology.
+ */
+interface SubnetInstanceInfo {
+    /** Instantiation prefix (e.g. `"buf1"` or `"outer/inner"` for nested). */
+    readonly prefix: string;
+    /** Originating subnet definition name; absent in v1. */
+    readonly defName?: string;
+    /** Full prefixed transition names belonging to this instance. */
+    readonly transitionNames: readonly string[];
+    /** Full prefixed place names belonging to this instance. */
+    readonly exposedPlaceNames: readonly string[];
+    /** Parent-instance prefix; absent for top-level instances. */
+    readonly parentPrefix?: string;
+}
 interface ArchiveSummary {
     readonly sessionId: string;
     readonly key: string;
@@ -164,6 +198,13 @@ type DebugResponse = {
     readonly inFlightTransitions: readonly string[];
     readonly eventCount: number;
     readonly mode: string;
+    /**
+     * Composed subnet instance descriptors per
+     * `spec/11-modular-composition.md` **MOD-041**. Empty array for nets
+     * that were not produced via composition (no `/` in any node name) —
+     * keeps the wire payload compact for the flat case.
+     */
+    readonly subnetInstances: readonly SubnetInstanceInfo[];
 } | {
     readonly type: 'unsubscribed';
     readonly sessionId: string;
@@ -350,7 +391,13 @@ interface DebugSession {
      */
     readonly tags: Record<string, string>;
 }
-/** Builds the net structure from a session's stored place and transition info. */
+/**
+ * Builds the net structure from a session's stored place and transition info.
+ *
+ * Populates the per-place and per-transition `instancePrefix` field per
+ * `spec/11-modular-composition.md` **MOD-041**: derived from the `/` prefix
+ * portion of each name, omitted entirely for flat names.
+ */
 declare function buildNetStructure(session: DebugSession): NetStructure;
 type EventStoreFactory = (sessionId: string) => DebugEventStore;
 declare class DebugSessionRegistry {