libpetri 1.8.5 → 2.1.0

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "libpetri",
-  "version": "1.8.5",
+  "version": "2.1.0",
   "description": "Coloured Time Petri Net engine — TypeScript port",
   "homepage": "https://libpetri.org",
   "repository": {
@@ -46,10 +46,23 @@
     "./render-dom": {
       "import": "./dist/render-dom/index.js",
       "types": "./dist/render-dom/index.d.ts"
-    }
+    },
+    "./viewer": {
+      "import": "./dist/viewer/index.js",
+      "types": "./dist/viewer/index.d.ts"
+    },
+    "./viewer/layout": {
+      "node": {
+        "import": "./dist/viewer/layout/index.js",
+        "types": "./dist/viewer/layout/index.d.ts"
+      }
+    },
+    "./viewer/iife": "./dist/viewer/viewer.iife.js",
+    "./viewer/css": "./dist/viewer/viewer.css"
   },
   "scripts": {
     "build": "tsup",
+    "build:viewer": "tsup && node scripts/build-viewer-iife.mjs",
     "check": "tsc --noEmit",
     "test": "vitest run",
     "test:watch": "vitest",
@@ -59,18 +72,22 @@
     "regenerate-sample": "tsx scripts/regenerate-sample.ts"
   },
   "devDependencies": {
-    "@types/node": "^25.4.0",
-    "@viz-js/viz": "^3.25.0",
+    "@types/node": "^25.8.0",
+    "@viz-js/viz": "^3.27.0",
+    "elkjs": "^0.11.1",
+    "fast-check": "^4.8.0",
+    "happy-dom": "^20.9.0",
     "panzoom": "^9.4.4",
     "tsup": "^8.5.1",
-    "tsx": "^4.21.0",
-    "typedoc": "^0.28.17",
+    "tsx": "^4.22.0",
+    "typedoc": "^0.28.19",
     "typescript": "^5.9.3",
-    "vite": "^6.4.2",
-    "vitest": "^4.0.18"
+    "vite": "^8.0.13",
+    "vitest": "^4.1.6"
   },
   "peerDependencies": {
     "@viz-js/viz": ">=3.0.0",
+    "elkjs": ">=0.9.0",
     "panzoom": ">=9.0.0",
     "typedoc": ">=0.27.0"
   },
@@ -81,6 +98,9 @@
     "@viz-js/viz": {
       "optional": true
     },
+    "elkjs": {
+      "optional": true
+    },
     "panzoom": {
       "optional": true
     }

package/dist/chunk-B2D5DMTO.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/export/styles.ts","../src/export/petri-net-mapper.ts","../src/export/dot-renderer.ts","../src/export/dot-exporter.ts"],"sourcesContent":["// GENERATED from spec/petri-net-styles.json — do not edit manually.\n// Regenerate with: scripts/generate-styles.sh\n\n/**\n * Style loader for Petri net visualization.\n *\n * Reads the shared style definition from `spec/petri-net-styles.json` and\n * exposes typed accessors for node and edge visual properties.\n *\n * @module export/styles\n */\n\nimport type { NodeShape, EdgeLineStyle, ArrowHead } from './graph.js';\n\n// ======================== Style Types ========================\n\nexport interface NodeVisual {\n  readonly shape: NodeShape;\n  readonly fill: string;\n  readonly stroke: string;\n  readonly penwidth: number;\n  readonly style?: string;\n  readonly height?: number;\n  readonly width?: number;\n}\n\nexport interface EdgeVisual {\n  readonly color: string;\n  readonly style: EdgeLineStyle;\n  readonly arrowhead: ArrowHead;\n  readonly penwidth?: number;\n}\n\nexport interface FontStyle {\n  readonly family: string;\n  readonly nodeSize: number;\n  readonly edgeSize: number;\n}\n\nexport interface GraphStyle {\n  readonly nodesep: number;\n  readonly ranksep: number;\n  readonly forcelabels: boolean;\n  readonly overlap: boolean;\n  readonly outputorder: string;\n}\n\n// ======================== Inline Style Data ========================\n\n// Inlined from spec/petri-net-styles.json to avoid runtime JSON import issues.\n// Keep in sync with the spec file.\n\nconst NODE_STYLES: Record<NodeCategory, NodeVisual> = {\n  place:          { shape: 'circle',  fill: '#FFFFFF', stroke: '#333333', penwidth: 1.5, width: 0.35 },\n  start:          { shape: 'circle',  fill: '#d4edda', stroke: '#28a745', penwidth: 2.0, width: 0.35 },\n  end:            { shape: 'doublecircle',  fill: '#cce5ff', stroke: '#004085', penwidth: 2.0, width: 0.35 },\n  environment:    { shape: 'circle',  fill: '#f8d7da', stroke: '#721c24', penwidth: 2.0, style: 'dashed', width: 0.35 },\n  transition:     { shape: 'box',  fill: '#fff3cd', stroke: '#856404', penwidth: 1.0, height: 0.4, width: 0.8 },\n  'xor-junction': { shape: 'diamond',  fill: '#FFFFFF', stroke: '#333333', penwidth: 1.0, height: 0.3, width: 0.3 },\n  'and-junction': { shape: 'diamond',  fill: '#FFFFFF', stroke: '#333333', penwidth: 1.0, height: 0.3, width: 0.3 },\n};\n\nconst EDGE_STYLES: Record<EdgeCategory, EdgeVisual> = {\n  input:         { color: '#333333', style: 'solid',  arrowhead: 'normal' },\n  output:        { color: '#333333', style: 'solid',  arrowhead: 'normal' },\n  inhibitor:     { color: '#dc3545', style: 'solid',  arrowhead: 'odot' },\n  read:          { color: '#6c757d', style: 'dashed',  arrowhead: 'normal' },\n  reset:         { color: '#fd7e14', style: 'bold',  arrowhead: 'normal',  penwidth: 2.0 },\n  'reset-output': { color: '#fd7e14', style: 'bold',  arrowhead: 'normal',  penwidth: 2.0 },\n};\n\nexport const FONT: FontStyle = { family: 'Helvetica,Arial,sans-serif', nodeSize: 12, edgeSize: 10 };\n\nexport const GRAPH: GraphStyle = { nodesep: 0.5, ranksep: 0.75, forcelabels: true, overlap: false, outputorder: 'edgesfirst' };\n\n// ======================== Public API ========================\n\nexport type NodeCategory = 'place' | 'start' | 'end' | 'environment' | 'transition' | 'xor-junction' | 'and-junction';\nexport type EdgeCategory = 'input' | 'output' | 'inhibitor' | 'read' | 'reset' | 'reset-output';\n\n/** Returns the visual style for the given node category. */\nexport function nodeStyle(category: NodeCategory): NodeVisual {\n  return NODE_STYLES[category];\n}\n\n/** Returns the visual style for the given edge/arc type. */\nexport function edgeStyle(arcType: EdgeCategory): EdgeVisual {\n  return EDGE_STYLES[arcType];\n}\n","/**\n * Maps a PetriNet definition to a format-agnostic Graph.\n *\n * Petri net semantics live here. The mapper applies the visualization rules\n * specified in spec/09-export.md (EXP-012, EXP-013, EXP-014):\n *\n * - XOR / AND output groups with ≥2 children become synthetic junction nodes\n *   (diamond for XOR, square for AND).\n * - Output + reset arcs to the same place collapse into a single edge styled\n *   as the reset-output category and labelled \"reset+out\".\n * - Junction IDs use the form j_<transition>__<kind>_<idx>, where idx is a\n *   depth-first pre-order counter starting at 0.\n *\n * @module export/petri-net-mapper\n */\n\nimport type { PetriNet } from '../core/petri-net.js';\nimport type { Transition } from '../core/transition.js';\nimport type { Out } from '../core/out.js';\nimport { earliest, latest, hasDeadline } from '../core/timing.js';\nimport type { Graph, GraphNode, GraphEdge, RankDir } from './graph.js';\nimport { nodeStyle, edgeStyle, FONT, GRAPH } from './styles.js';\nimport type { NodeCategory } from './styles.js';\n\n// ======================== Configuration ========================\n\nexport interface DotConfig {\n  readonly direction: RankDir;\n  readonly showTypes: boolean;\n  readonly showIntervals: boolean;\n  readonly showPriority: boolean;\n  readonly environmentPlaces?: ReadonlySet<string>;\n}\n\nexport const DEFAULT_DOT_CONFIG: DotConfig = {\n  direction: 'TB',\n  showTypes: true,\n  showIntervals: true,\n  showPriority: true,\n};\n\n// ======================== Public API ========================\n\n/** Sanitizes a name for use as a graph node ID. */\nexport function sanitize(name: string): string {\n  return name.replace(/[^a-zA-Z0-9_]/g, '_');\n}\n\n/** Maps a PetriNet to a format-agnostic Graph. */\nexport function mapToGraph(net: PetriNet, config: DotConfig = DEFAULT_DOT_CONFIG): Graph {\n  const places = analyzePlaces(net);\n  const envNames = config.environmentPlaces ?? new Set<string>();\n\n  const nodes: GraphNode[] = [];\n  const edges: GraphEdge[] = [];\n\n  // Place nodes\n  for (const [name, info] of places) {\n    const category = placeCategory(info, envNames.has(name));\n    const style = nodeStyle(category);\n    nodes.push({\n      id: 'p_' + sanitize(name),\n      label: '',\n      shape: style.shape,\n      fill: style.fill,\n      stroke: style.stroke,\n      penwidth: style.penwidth,\n      semanticId: name,\n      style: style.style,\n      width: style.width,\n      attrs: { xlabel: name, fixedsize: 'true' },\n    });\n  }\n\n  // Transition nodes\n  for (const t of net.transitions) {\n    const style = nodeStyle('transition');\n    nodes.push({\n      id: 't_' + sanitize(t.name),\n      label: transitionLabel(t, config),\n      shape: style.shape,\n      fill: style.fill,\n      stroke: style.stroke,\n      penwidth: style.penwidth,\n      semanticId: t.name,\n      height: style.height,\n      width: style.width,\n    });\n  }\n\n  // Edges (and junction nodes)\n  for (const t of net.transitions) {\n    const tid = 't_' + sanitize(t.name);\n    const tSanitized = sanitize(t.name);\n    const resetPlaces = new Set(t.resets.map(r => r.place.name));\n    const combined = new Set<string>();\n\n    // Input arcs from inputSpecs\n    for (const spec of t.inputSpecs) {\n      const pid = 'p_' + sanitize(spec.place.name);\n      const inputStyle = edgeStyle('input');\n      let label: string | undefined;\n      switch (spec.type) {\n        case 'exactly':\n          label = `×${spec.count}`;\n          break;\n        case 'all':\n          label = '*';\n          break;\n        case 'at-least':\n          label = `≥${spec.minimum}`;\n          break;\n      }\n      edges.push({\n        from: pid,\n        to: tid,\n        label,\n        color: inputStyle.color,\n        style: inputStyle.style,\n        arrowhead: inputStyle.arrowhead,\n        arcType: 'input',\n      });\n    }\n\n    // Output arcs from outputSpec — emits junction nodes + edges, marks combined places.\n    if (t.outputSpec !== null) {\n      const ctx: EmitCtx = {\n        tSanitized,\n        resetPlaces,\n        combined,\n        nodes,\n        edges,\n        counter: 0,\n      };\n      emitOutput(t.outputSpec, tid, null, ctx);\n    }\n\n    // Inhibitor arcs\n    for (const inh of t.inhibitors) {\n      const pid = 'p_' + sanitize(inh.place.name);\n      const inhStyle = edgeStyle('inhibitor');\n      edges.push({\n        from: pid,\n        to: tid,\n        color: inhStyle.color,\n        style: inhStyle.style,\n        arrowhead: inhStyle.arrowhead,\n        arcType: 'inhibitor',\n      });\n    }\n\n    // Read arcs\n    for (const r of t.reads) {\n      const pid = 'p_' + sanitize(r.place.name);\n      const readStyle = edgeStyle('read');\n      edges.push({\n        from: pid,\n        to: tid,\n        label: 'read',\n        color: readStyle.color,\n        style: readStyle.style,\n        arrowhead: readStyle.arrowhead,\n        arcType: 'read',\n      });\n    }\n\n    // Standalone reset arcs (only those not already combined with an output)\n    for (const rst of t.resets) {\n      if (!combined.has(rst.place.name)) {\n        const pid = 'p_' + sanitize(rst.place.name);\n        const resetStyle = edgeStyle('reset');\n        edges.push({\n          from: tid,\n          to: pid,\n          label: 'reset',\n          color: resetStyle.color,\n          style: resetStyle.style,\n          arrowhead: resetStyle.arrowhead,\n          penwidth: resetStyle.penwidth,\n          arcType: 'reset',\n        });\n      }\n    }\n  }\n\n  return {\n    id: sanitize(net.name),\n    rankdir: config.direction,\n    nodes,\n    edges,\n    subgraphs: [],\n    graphAttrs: {\n      nodesep: String(GRAPH.nodesep),\n      ranksep: String(GRAPH.ranksep),\n      forcelabels: String(GRAPH.forcelabels),\n      overlap: String(GRAPH.overlap),\n      fontname: FONT.family,\n      outputorder: GRAPH.outputorder,\n    },\n    nodeDefaults: {\n      fontname: FONT.family,\n      fontsize: String(FONT.nodeSize),\n    },\n    edgeDefaults: {\n      fontname: FONT.family,\n      fontsize: String(FONT.edgeSize),\n    },\n  };\n}\n\n// ======================== Place Analysis ========================\n\ninterface PlaceInfo {\n  hasIncoming: boolean;\n  hasOutgoing: boolean;\n}\n\nfunction analyzePlaces(net: PetriNet): Map<string, PlaceInfo> {\n  const map = new Map<string, PlaceInfo>();\n\n  function ensure(name: string): PlaceInfo {\n    let info = map.get(name);\n    if (!info) {\n      info = { hasIncoming: false, hasOutgoing: false };\n      map.set(name, info);\n    }\n    return info;\n  }\n\n  for (const t of net.transitions) {\n    for (const spec of t.inputSpecs) {\n      ensure(spec.place.name).hasOutgoing = true;\n    }\n    if (t.outputSpec !== null) {\n      for (const p of t.outputPlaces()) {\n        ensure(p.name).hasIncoming = true;\n      }\n    }\n    for (const inh of t.inhibitors) {\n      ensure(inh.place.name);\n    }\n    for (const r of t.reads) {\n      ensure(r.place.name).hasOutgoing = true;\n    }\n    for (const rst of t.resets) {\n      ensure(rst.place.name);\n    }\n  }\n\n  return map;\n}\n\nfunction placeCategory(info: PlaceInfo, isEnvironment: boolean): NodeCategory {\n  if (isEnvironment) return 'environment';\n  if (!info.hasIncoming) return 'start';\n  if (!info.hasOutgoing) return 'end';\n  return 'place';\n}\n\n// ======================== Helpers ========================\n\nfunction transitionLabel(t: Transition, config: DotConfig): string {\n  const parts = [t.name];\n\n  if (config.showIntervals) {\n    const e = earliest(t.timing);\n    const l = latest(t.timing);\n    const max = hasDeadline(t.timing) ? String(l) : '∞';\n    parts.push(`[${e}, ${max}]ms`);\n  }\n\n  if (config.showPriority && t.priority !== 0) {\n    parts.push(`prio=${t.priority}`);\n  }\n\n  return parts.join(' ');\n}\n\n/**\n * Mutable per-transition state threaded through the recursive Out-tree walk.\n *\n * `counter` starts at 0 and increments once per emitted junction (depth-first\n * pre-order). `combined` accumulates place names where a reset+output combination\n * short-circuited the standalone reset edge.\n */\ninterface EmitCtx {\n  readonly tSanitized: string;\n  readonly resetPlaces: ReadonlySet<string>;\n  readonly combined: Set<string>;\n  readonly nodes: GraphNode[];\n  readonly edges: GraphEdge[];\n  counter: number;\n}\n\n/**\n * Emits output edges for an Out tree, inserting junction nodes for XOR/AND\n * groups with ≥2 children. Combined reset+output edges replace plain output\n * edges when a leaf place is also in `ctx.resetPlaces`.\n *\n * @param out          current Out subtree\n * @param parentId     id of the parent node (transition or junction)\n * @param branchLabel  label to apply to the edge entering this Out (timeout/XOR-branch label)\n * @param ctx          per-transition junction context (counter, reset set, accumulators)\n */\nfunction emitOutput(out: Out, parentId: string, branchLabel: string | null, ctx: EmitCtx): void {\n  switch (out.type) {\n    case 'place': {\n      const pid = 'p_' + sanitize(out.place.name);\n      pushLeafEdge(parentId, pid, out.place.name, branchLabel, ctx, false);\n      return;\n    }\n\n    case 'forward-input': {\n      const pid = 'p_' + sanitize(out.to.name);\n      const fwdLabel = (branchLabel ? branchLabel + ' ' : '') + '⟵' + out.from.name;\n      // ForwardInput is dashed; reset+out combination overrides if applicable.\n      pushLeafEdge(parentId, pid, out.to.name, fwdLabel, ctx, true);\n      return;\n    }\n\n    case 'and':\n    case 'xor': {\n      // Single-child groups collapse: pass through.\n      if (out.children.length < 2) {\n        if (out.children.length === 1) {\n          emitOutput(out.children[0]!, parentId, branchLabel, ctx);\n        }\n        return;\n      }\n\n      // Insert junction node — diamond gateway with heavy ✕ / ✚ glyph as discriminator.\n      const kind = out.type;\n      const idx = ctx.counter++;\n      const junctionId = `j_${ctx.tSanitized}__${kind}_${idx}`;\n      const category: NodeCategory = kind === 'xor' ? 'xor-junction' : 'and-junction';\n      const jStyle = nodeStyle(category);\n      ctx.nodes.push({\n        id: junctionId,\n        label: kind === 'xor' ? '✕' : '✚',\n        shape: jStyle.shape,\n        fill: jStyle.fill,\n        stroke: jStyle.stroke,\n        penwidth: jStyle.penwidth,\n        semanticId: junctionId,\n        height: jStyle.height,\n        width: jStyle.width,\n        attrs: { fixedsize: 'true', fontsize: '14' },\n      });\n\n      // Edge parent → junction (carries any inherited branch/timeout label).\n      const outStyle = edgeStyle('output');\n      ctx.edges.push({\n        from: parentId,\n        to: junctionId,\n        label: branchLabel ?? undefined,\n        color: outStyle.color,\n        style: outStyle.style,\n        arrowhead: outStyle.arrowhead,\n        arcType: 'output',\n      });\n\n      // Recurse children: XOR junction propagates per-branch labels; AND junction does not.\n      for (const child of out.children) {\n        const childLabel = kind === 'xor' ? inferBranchLabel(child) : null;\n        emitOutput(child, junctionId, childLabel, ctx);\n      }\n      return;\n    }\n\n    case 'timeout': {\n      // Override any inherited branchLabel: the timeout label fully describes\n      // this branch (the XOR pre-inference resolves to the same string).\n      const timeoutLabel = `⏱${out.afterMs}ms`;\n      emitOutput(out.child, parentId, timeoutLabel, ctx);\n      return;\n    }\n  }\n}\n\nfunction pushLeafEdge(\n  fromId: string,\n  toId: string,\n  placeName: string,\n  branchLabel: string | null,\n  ctx: EmitCtx,\n  isForwardInput: boolean,\n): void {\n  if (ctx.resetPlaces.has(placeName)) {\n    ctx.combined.add(placeName);\n    const ro = edgeStyle('reset-output');\n    ctx.edges.push({\n      from: fromId,\n      to: toId,\n      label: 'reset+out',\n      color: ro.color,\n      style: ro.style,\n      arrowhead: ro.arrowhead,\n      penwidth: ro.penwidth,\n      arcType: 'reset-output',\n    });\n    return;\n  }\n\n  const out = edgeStyle('output');\n  ctx.edges.push({\n    from: fromId,\n    to: toId,\n    label: branchLabel ?? undefined,\n    color: out.color,\n    style: isForwardInput ? 'dashed' : out.style,\n    arrowhead: out.arrowhead,\n    arcType: 'output',\n  });\n}\n\nfunction inferBranchLabel(out: Out): string | null {\n  switch (out.type) {\n    case 'place': return out.place.name;\n    case 'timeout': return `⏱${out.afterMs}ms`;\n    case 'forward-input': return out.to.name;\n    case 'and':\n    case 'xor':\n      return null;\n  }\n}\n","/**\n * Renders a Graph to DOT (Graphviz) string.\n *\n * Pure function with zero Petri net knowledge. Operates solely on the\n * format-agnostic Graph model.\n *\n * @module export/dot-renderer\n */\n\nimport type { Graph, GraphNode, GraphEdge, Subgraph } from './graph.js';\n\n// ======================== Public API ========================\n\n/** Renders a Graph to a DOT string suitable for Graphviz. */\nexport function renderDot(graph: Graph): string {\n  const lines: string[] = [];\n\n  lines.push(`digraph ${quoteId(graph.id)} {`);\n\n  // Graph attributes\n  lines.push(`    rankdir=${graph.rankdir};`);\n  for (const [key, value] of Object.entries(graph.graphAttrs)) {\n    lines.push(`    ${key}=${quoteAttr(value)};`);\n  }\n\n  // Node defaults\n  if (Object.keys(graph.nodeDefaults).length > 0) {\n    lines.push(`    node [${formatAttrs(graph.nodeDefaults)}];`);\n  }\n\n  // Edge defaults\n  if (Object.keys(graph.edgeDefaults).length > 0) {\n    lines.push(`    edge [${formatAttrs(graph.edgeDefaults)}];`);\n  }\n\n  lines.push('');\n\n  // Subgraphs\n  for (const sg of graph.subgraphs) {\n    lines.push(...renderSubgraph(sg, '    '));\n    lines.push('');\n  }\n\n  // Nodes\n  for (const node of graph.nodes) {\n    lines.push(`    ${renderNode(node)}`);\n  }\n\n  if (graph.nodes.length > 0) {\n    lines.push('');\n  }\n\n  // Edges\n  for (const edge of graph.edges) {\n    lines.push(`    ${renderEdge(edge)}`);\n  }\n\n  lines.push('}');\n\n  return lines.join('\\n');\n}\n\n// ======================== Internal Rendering ========================\n\nfunction renderNode(node: GraphNode): string {\n  const attrs: Record<string, string> = {\n    label: node.label,\n    shape: node.shape,\n    style: node.style ? `\"filled,${node.style}\"` : 'filled',\n    fillcolor: node.fill,\n    color: node.stroke,\n    penwidth: String(node.penwidth),\n  };\n\n  if (node.height !== undefined) {\n    attrs['height'] = String(node.height);\n  }\n  if (node.width !== undefined) {\n    attrs['width'] = String(node.width);\n  }\n\n  // Merge extra attrs\n  if (node.attrs) {\n    for (const [key, value] of Object.entries(node.attrs)) {\n      attrs[key] = value;\n    }\n  }\n\n  return `${quoteId(node.id)} [${formatNodeAttrs(attrs)}];`;\n}\n\nfunction renderEdge(edge: GraphEdge): string {\n  const attrs: Record<string, string> = {\n    color: edge.color,\n    style: edge.style,\n    arrowhead: edge.arrowhead,\n  };\n\n  if (edge.label !== undefined) {\n    attrs['label'] = edge.label;\n  }\n  if (edge.penwidth !== undefined) {\n    attrs['penwidth'] = String(edge.penwidth);\n  }\n\n  // Merge extra attrs\n  if (edge.attrs) {\n    for (const [key, value] of Object.entries(edge.attrs)) {\n      attrs[key] = value;\n    }\n  }\n\n  return `${quoteId(edge.from)} -> ${quoteId(edge.to)} [${formatNodeAttrs(attrs)}];`;\n}\n\nfunction renderSubgraph(sg: Subgraph, indent: string): string[] {\n  const lines: string[] = [];\n  lines.push(`${indent}subgraph ${quoteId('cluster_' + sg.id)} {`);\n\n  if (sg.label !== undefined) {\n    lines.push(`${indent}    label=${quoteAttr(sg.label)};`);\n  }\n\n  if (sg.attrs) {\n    for (const [key, value] of Object.entries(sg.attrs)) {\n      lines.push(`${indent}    ${key}=${quoteAttr(value)};`);\n    }\n  }\n\n  for (const node of sg.nodes) {\n    lines.push(`${indent}    ${renderNode(node)}`);\n  }\n\n  lines.push(`${indent}}`);\n  return lines;\n}\n\n// ======================== DOT Quoting ========================\n\n/** Quotes a DOT identifier. Always quotes to be safe with special chars. */\nfunction quoteId(id: string): string {\n  // DOT keywords that must be quoted\n  if (/^[a-zA-Z_][a-zA-Z0-9_]*$/.test(id) && !isDotKeyword(id)) {\n    return id;\n  }\n  return `\"${escapeDot(id)}\"`;\n}\n\n/** Quotes a DOT attribute value. */\nfunction quoteAttr(value: string): string {\n  // Numbers don't need quoting\n  if (/^-?\\d+(\\.\\d+)?$/.test(value)) {\n    return value;\n  }\n  return `\"${escapeDot(value)}\"`;\n}\n\n/** Escapes special characters for DOT strings. */\nfunction escapeDot(s: string): string {\n  return s.replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"');\n}\n\n/**\n * Formats node/edge attributes where certain values (like style with commas)\n * need special handling.\n */\nfunction formatNodeAttrs(attrs: Record<string, string>): string {\n  return Object.entries(attrs)\n    .map(([key, value]) => {\n      // Style values that are already pre-quoted (contain the quote char)\n      if (value.startsWith('\"') && value.endsWith('\"')) {\n        return `${key}=${value}`;\n      }\n      return `${key}=${quoteAttr(value)}`;\n    })\n    .join(', ');\n}\n\n/** Formats simple key=value attributes. */\nfunction formatAttrs(attrs: Readonly<Record<string, string>>): string {\n  return Object.entries(attrs)\n    .map(([key, value]) => `${key}=${quoteAttr(value)}`)\n    .join(', ');\n}\n\n/** DOT language keywords that must be quoted when used as identifiers. */\nfunction isDotKeyword(id: string): boolean {\n  const lower = id.toLowerCase();\n  return lower === 'graph' || lower === 'digraph' || lower === 'subgraph'\n    || lower === 'node' || lower === 'edge' || lower === 'strict';\n}\n","/**\n * Convenience function for exporting a PetriNet to DOT format.\n *\n * @module export/dot-exporter\n */\n\nimport type { PetriNet } from '../core/petri-net.js';\nimport type { DotConfig } from './petri-net-mapper.js';\nimport { mapToGraph } from './petri-net-mapper.js';\nimport { renderDot } from './dot-renderer.js';\n\n/**\n * Exports a PetriNet to DOT (Graphviz) format.\n *\n * @param net the Petri net to export\n * @param config optional export configuration\n * @returns DOT string suitable for rendering with Graphviz\n */\nexport function dotExport(net: PetriNet, config?: DotConfig): string {\n  return renderDot(mapToGraph(net, config));\n}\n"],"mappings":";;;;;;;AAoDA,IAAM,cAAgD;AAAA,EACpD,OAAgB,EAAE,OAAO,UAAW,MAAM,WAAW,QAAQ,WAAW,UAAU,KAAK,OAAO,KAAK;AAAA,EACnG,OAAgB,EAAE,OAAO,UAAW,MAAM,WAAW,QAAQ,WAAW,UAAU,GAAK,OAAO,KAAK;AAAA,EACnG,KAAgB,EAAE,OAAO,gBAAiB,MAAM,WAAW,QAAQ,WAAW,UAAU,GAAK,OAAO,KAAK;AAAA,EACzG,aAAgB,EAAE,OAAO,UAAW,MAAM,WAAW,QAAQ,WAAW,UAAU,GAAK,OAAO,UAAU,OAAO,KAAK;AAAA,EACpH,YAAgB,EAAE,OAAO,OAAQ,MAAM,WAAW,QAAQ,WAAW,UAAU,GAAK,QAAQ,KAAK,OAAO,IAAI;AAAA,EAC5G,gBAAgB,EAAE,OAAO,WAAY,MAAM,WAAW,QAAQ,WAAW,UAAU,GAAK,QAAQ,KAAK,OAAO,IAAI;AAAA,EAChH,gBAAgB,EAAE,OAAO,WAAY,MAAM,WAAW,QAAQ,WAAW,UAAU,GAAK,QAAQ,KAAK,OAAO,IAAI;AAClH;AAEA,IAAM,cAAgD;AAAA,EACpD,OAAe,EAAE,OAAO,WAAW,OAAO,SAAU,WAAW,SAAS;AAAA,EACxE,QAAe,EAAE,OAAO,WAAW,OAAO,SAAU,WAAW,SAAS;AAAA,EACxE,WAAe,EAAE,OAAO,WAAW,OAAO,SAAU,WAAW,OAAO;AAAA,EACtE,MAAe,EAAE,OAAO,WAAW,OAAO,UAAW,WAAW,SAAS;AAAA,EACzE,OAAe,EAAE,OAAO,WAAW,OAAO,QAAS,WAAW,UAAW,UAAU,EAAI;AAAA,EACvF,gBAAgB,EAAE,OAAO,WAAW,OAAO,QAAS,WAAW,UAAW,UAAU,EAAI;AAC1F;AAEO,IAAM,OAAkB,EAAE,QAAQ,8BAA8B,UAAU,IAAI,UAAU,GAAG;AAE3F,IAAM,QAAoB,EAAE,SAAS,KAAK,SAAS,MAAM,aAAa,MAAM,SAAS,OAAO,aAAa,aAAa;AAQtH,SAAS,UAAU,UAAoC;AAC5D,SAAO,YAAY,QAAQ;AAC7B;AAGO,SAAS,UAAU,SAAmC;AAC3D,SAAO,YAAY,OAAO;AAC5B;;;ACtDO,IAAM,qBAAgC;AAAA,EAC3C,WAAW;AAAA,EACX,WAAW;AAAA,EACX,eAAe;AAAA,EACf,cAAc;AAChB;AAKO,SAAS,SAAS,MAAsB;AAC7C,SAAO,KAAK,QAAQ,kBAAkB,GAAG;AAC3C;AAGO,SAAS,WAAW,KAAe,SAAoB,oBAA2B;AACvF,QAAM,SAAS,cAAc,GAAG;AAChC,QAAM,WAAW,OAAO,qBAAqB,oBAAI,IAAY;AAE7D,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAqB,CAAC;AAG5B,aAAW,CAAC,MAAM,IAAI,KAAK,QAAQ;AACjC,UAAM,WAAW,cAAc,MAAM,SAAS,IAAI,IAAI,CAAC;AACvD,UAAM,QAAQ,UAAU,QAAQ;AAChC,UAAM,KAAK;AAAA,MACT,IAAI,OAAO,SAAS,IAAI;AAAA,MACxB,OAAO;AAAA,MACP,OAAO,MAAM;AAAA,MACb,MAAM,MAAM;AAAA,MACZ,QAAQ,MAAM;AAAA,MACd,UAAU,MAAM;AAAA,MAChB,YAAY;AAAA,MACZ,OAAO,MAAM;AAAA,MACb,OAAO,MAAM;AAAA,MACb,OAAO,EAAE,QAAQ,MAAM,WAAW,OAAO;AAAA,IAC3C,CAAC;AAAA,EACH;AAGA,aAAW,KAAK,IAAI,aAAa;AAC/B,UAAM,QAAQ,UAAU,YAAY;AACpC,UAAM,KAAK;AAAA,MACT,IAAI,OAAO,SAAS,EAAE,IAAI;AAAA,MAC1B,OAAO,gBAAgB,GAAG,MAAM;AAAA,MAChC,OAAO,MAAM;AAAA,MACb,MAAM,MAAM;AAAA,MACZ,QAAQ,MAAM;AAAA,MACd,UAAU,MAAM;AAAA,MAChB,YAAY,EAAE;AAAA,MACd,QAAQ,MAAM;AAAA,MACd,OAAO,MAAM;AAAA,IACf,CAAC;AAAA,EACH;AAGA,aAAW,KAAK,IAAI,aAAa;AAC/B,UAAM,MAAM,OAAO,SAAS,EAAE,IAAI;AAClC,UAAM,aAAa,SAAS,EAAE,IAAI;AAClC,UAAM,cAAc,IAAI,IAAI,EAAE,OAAO,IAAI,OAAK,EAAE,MAAM,IAAI,CAAC;AAC3D,UAAM,WAAW,oBAAI,IAAY;AAGjC,eAAW,QAAQ,EAAE,YAAY;AAC/B,YAAM,MAAM,OAAO,SAAS,KAAK,MAAM,IAAI;AAC3C,YAAM,aAAa,UAAU,OAAO;AACpC,UAAI;AACJ,cAAQ,KAAK,MAAM;AAAA,QACjB,KAAK;AACH,kBAAQ,OAAI,KAAK,KAAK;AACtB;AAAA,QACF,KAAK;AACH,kBAAQ;AACR;AAAA,QACF,KAAK;AACH,kBAAQ,SAAI,KAAK,OAAO;AACxB;AAAA,MACJ;AACA,YAAM,KAAK;AAAA,QACT,MAAM;AAAA,QACN,IAAI;AAAA,QACJ;AAAA,QACA,OAAO,WAAW;AAAA,QAClB,OAAO,WAAW;AAAA,QAClB,WAAW,WAAW;AAAA,QACtB,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AAGA,QAAI,EAAE,eAAe,MAAM;AACzB,YAAM,MAAe;AAAA,QACnB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,SAAS;AAAA,MACX;AACA,iBAAW,EAAE,YAAY,KAAK,MAAM,GAAG;AAAA,IACzC;AAGA,eAAW,OAAO,EAAE,YAAY;AAC9B,YAAM,MAAM,OAAO,SAAS,IAAI,MAAM,IAAI;AAC1C,YAAM,WAAW,UAAU,WAAW;AACtC,YAAM,KAAK;AAAA,QACT,MAAM;AAAA,QACN,IAAI;AAAA,QACJ,OAAO,SAAS;AAAA,QAChB,OAAO,SAAS;AAAA,QAChB,WAAW,SAAS;AAAA,QACpB,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AAGA,eAAW,KAAK,EAAE,OAAO;AACvB,YAAM,MAAM,OAAO,SAAS,EAAE,MAAM,IAAI;AACxC,YAAM,YAAY,UAAU,MAAM;AAClC,YAAM,KAAK;AAAA,QACT,MAAM;AAAA,QACN,IAAI;AAAA,QACJ,OAAO;AAAA,QACP,OAAO,UAAU;AAAA,QACjB,OAAO,UAAU;AAAA,QACjB,WAAW,UAAU;AAAA,QACrB,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AAGA,eAAW,OAAO,EAAE,QAAQ;AAC1B,UAAI,CAAC,SAAS,IAAI,IAAI,MAAM,IAAI,GAAG;AACjC,cAAM,MAAM,OAAO,SAAS,IAAI,MAAM,IAAI;AAC1C,cAAM,aAAa,UAAU,OAAO;AACpC,cAAM,KAAK;AAAA,UACT,MAAM;AAAA,UACN,IAAI;AAAA,UACJ,OAAO;AAAA,UACP,OAAO,WAAW;AAAA,UAClB,OAAO,WAAW;AAAA,UAClB,WAAW,WAAW;AAAA,UACtB,UAAU,WAAW;AAAA,UACrB,SAAS;AAAA,QACX,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,IAAI,SAAS,IAAI,IAAI;AAAA,IACrB,SAAS,OAAO;AAAA,IAChB;AAAA,IACA;AAAA,IACA,WAAW,CAAC;AAAA,IACZ,YAAY;AAAA,MACV,SAAS,OAAO,MAAM,OAAO;AAAA,MAC7B,SAAS,OAAO,MAAM,OAAO;AAAA,MAC7B,aAAa,OAAO,MAAM,WAAW;AAAA,MACrC,SAAS,OAAO,MAAM,OAAO;AAAA,MAC7B,UAAU,KAAK;AAAA,MACf,aAAa,MAAM;AAAA,IACrB;AAAA,IACA,cAAc;AAAA,MACZ,UAAU,KAAK;AAAA,MACf,UAAU,OAAO,KAAK,QAAQ;AAAA,IAChC;AAAA,IACA,cAAc;AAAA,MACZ,UAAU,KAAK;AAAA,MACf,UAAU,OAAO,KAAK,QAAQ;AAAA,IAChC;AAAA,EACF;AACF;AASA,SAAS,cAAc,KAAuC;AAC5D,QAAM,MAAM,oBAAI,IAAuB;AAEvC,WAAS,OAAO,MAAyB;AACvC,QAAI,OAAO,IAAI,IAAI,IAAI;AACvB,QAAI,CAAC,MAAM;AACT,aAAO,EAAE,aAAa,OAAO,aAAa,MAAM;AAChD,UAAI,IAAI,MAAM,IAAI;AAAA,IACpB;AACA,WAAO;AAAA,EACT;AAEA,aAAW,KAAK,IAAI,aAAa;AAC/B,eAAW,QAAQ,EAAE,YAAY;AAC/B,aAAO,KAAK,MAAM,IAAI,EAAE,cAAc;AAAA,IACxC;AACA,QAAI,EAAE,eAAe,MAAM;AACzB,iBAAW,KAAK,EAAE,aAAa,GAAG;AAChC,eAAO,EAAE,IAAI,EAAE,cAAc;AAAA,MAC/B;AAAA,IACF;AACA,eAAW,OAAO,EAAE,YAAY;AAC9B,aAAO,IAAI,MAAM,IAAI;AAAA,IACvB;AACA,eAAW,KAAK,EAAE,OAAO;AACvB,aAAO,EAAE,MAAM,IAAI,EAAE,cAAc;AAAA,IACrC;AACA,eAAW,OAAO,EAAE,QAAQ;AAC1B,aAAO,IAAI,MAAM,IAAI;AAAA,IACvB;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,cAAc,MAAiB,eAAsC;AAC5E,MAAI,cAAe,QAAO;AAC1B,MAAI,CAAC,KAAK,YAAa,QAAO;AAC9B,MAAI,CAAC,KAAK,YAAa,QAAO;AAC9B,SAAO;AACT;AAIA,SAAS,gBAAgB,GAAe,QAA2B;AACjE,QAAM,QAAQ,CAAC,EAAE,IAAI;AAErB,MAAI,OAAO,eAAe;AACxB,UAAM,IAAI,SAAS,EAAE,MAAM;AAC3B,UAAM,IAAI,OAAO,EAAE,MAAM;AACzB,UAAM,MAAM,YAAY,EAAE,MAAM,IAAI,OAAO,CAAC,IAAI;AAChD,UAAM,KAAK,IAAI,CAAC,KAAK,GAAG,KAAK;AAAA,EAC/B;AAEA,MAAI,OAAO,gBAAgB,EAAE,aAAa,GAAG;AAC3C,UAAM,KAAK,QAAQ,EAAE,QAAQ,EAAE;AAAA,EACjC;AAEA,SAAO,MAAM,KAAK,GAAG;AACvB;AA4BA,SAAS,WAAW,KAAU,UAAkB,aAA4B,KAAoB;AAC9F,UAAQ,IAAI,MAAM;AAAA,IAChB,KAAK,SAAS;AACZ,YAAM,MAAM,OAAO,SAAS,IAAI,MAAM,IAAI;AAC1C,mBAAa,UAAU,KAAK,IAAI,MAAM,MAAM,aAAa,KAAK,KAAK;AACnE;AAAA,IACF;AAAA,IAEA,KAAK,iBAAiB;AACpB,YAAM,MAAM,OAAO,SAAS,IAAI,GAAG,IAAI;AACvC,YAAM,YAAY,cAAc,cAAc,MAAM,MAAM,WAAM,IAAI,KAAK;AAEzE,mBAAa,UAAU,KAAK,IAAI,GAAG,MAAM,UAAU,KAAK,IAAI;AAC5D;AAAA,IACF;AAAA,IAEA,KAAK;AAAA,IACL,KAAK,OAAO;AAEV,UAAI,IAAI,SAAS,SAAS,GAAG;AAC3B,YAAI,IAAI,SAAS,WAAW,GAAG;AAC7B,qBAAW,IAAI,SAAS,CAAC,GAAI,UAAU,aAAa,GAAG;AAAA,QACzD;AACA;AAAA,MACF;AAGA,YAAM,OAAO,IAAI;AACjB,YAAM,MAAM,IAAI;AAChB,YAAM,aAAa,KAAK,IAAI,UAAU,KAAK,IAAI,IAAI,GAAG;AACtD,YAAM,WAAyB,SAAS,QAAQ,iBAAiB;AACjE,YAAM,SAAS,UAAU,QAAQ;AACjC,UAAI,MAAM,KAAK;AAAA,QACb,IAAI;AAAA,QACJ,OAAO,SAAS,QAAQ,WAAM;AAAA,QAC9B,OAAO,OAAO;AAAA,QACd,MAAM,OAAO;AAAA,QACb,QAAQ,OAAO;AAAA,QACf,UAAU,OAAO;AAAA,QACjB,YAAY;AAAA,QACZ,QAAQ,OAAO;AAAA,QACf,OAAO,OAAO;AAAA,QACd,OAAO,EAAE,WAAW,QAAQ,UAAU,KAAK;AAAA,MAC7C,CAAC;AAGD,YAAM,WAAW,UAAU,QAAQ;AACnC,UAAI,MAAM,KAAK;AAAA,QACb,MAAM;AAAA,QACN,IAAI;AAAA,QACJ,OAAO,eAAe;AAAA,QACtB,OAAO,SAAS;AAAA,QAChB,OAAO,SAAS;AAAA,QAChB,WAAW,SAAS;AAAA,QACpB,SAAS;AAAA,MACX,CAAC;AAGD,iBAAW,SAAS,IAAI,UAAU;AAChC,cAAM,aAAa,SAAS,QAAQ,iBAAiB,KAAK,IAAI;AAC9D,mBAAW,OAAO,YAAY,YAAY,GAAG;AAAA,MAC/C;AACA;AAAA,IACF;AAAA,IAEA,KAAK,WAAW;AAGd,YAAM,eAAe,SAAI,IAAI,OAAO;AACpC,iBAAW,IAAI,OAAO,UAAU,cAAc,GAAG;AACjD;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,aACP,QACA,MACA,WACA,aACA,KACA,gBACM;AACN,MAAI,IAAI,YAAY,IAAI,SAAS,GAAG;AAClC,QAAI,SAAS,IAAI,SAAS;AAC1B,UAAM,KAAK,UAAU,cAAc;AACnC,QAAI,MAAM,KAAK;AAAA,MACb,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,OAAO;AAAA,MACP,OAAO,GAAG;AAAA,MACV,OAAO,GAAG;AAAA,MACV,WAAW,GAAG;AAAA,MACd,UAAU,GAAG;AAAA,MACb,SAAS;AAAA,IACX,CAAC;AACD;AAAA,EACF;AAEA,QAAM,MAAM,UAAU,QAAQ;AAC9B,MAAI,MAAM,KAAK;AAAA,IACb,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,OAAO,eAAe;AAAA,IACtB,OAAO,IAAI;AAAA,IACX,OAAO,iBAAiB,WAAW,IAAI;AAAA,IACvC,WAAW,IAAI;AAAA,IACf,SAAS;AAAA,EACX,CAAC;AACH;AAEA,SAAS,iBAAiB,KAAyB;AACjD,UAAQ,IAAI,MAAM;AAAA,IAChB,KAAK;AAAS,aAAO,IAAI,MAAM;AAAA,IAC/B,KAAK;AAAW,aAAO,SAAI,IAAI,OAAO;AAAA,IACtC,KAAK;AAAiB,aAAO,IAAI,GAAG;AAAA,IACpC,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,EACX;AACF;;;AC1ZO,SAAS,UAAU,OAAsB;AAC9C,QAAM,QAAkB,CAAC;AAEzB,QAAM,KAAK,WAAW,QAAQ,MAAM,EAAE,CAAC,IAAI;AAG3C,QAAM,KAAK,eAAe,MAAM,OAAO,GAAG;AAC1C,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,UAAU,GAAG;AAC3D,UAAM,KAAK,OAAO,GAAG,IAAI,UAAU,KAAK,CAAC,GAAG;AAAA,EAC9C;AAGA,MAAI,OAAO,KAAK,MAAM,YAAY,EAAE,SAAS,GAAG;AAC9C,UAAM,KAAK,aAAa,YAAY,MAAM,YAAY,CAAC,IAAI;AAAA,EAC7D;AAGA,MAAI,OAAO,KAAK,MAAM,YAAY,EAAE,SAAS,GAAG;AAC9C,UAAM,KAAK,aAAa,YAAY,MAAM,YAAY,CAAC,IAAI;AAAA,EAC7D;AAEA,QAAM,KAAK,EAAE;AAGb,aAAW,MAAM,MAAM,WAAW;AAChC,UAAM,KAAK,GAAG,eAAe,IAAI,MAAM,CAAC;AACxC,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,aAAW,QAAQ,MAAM,OAAO;AAC9B,UAAM,KAAK,OAAO,WAAW,IAAI,CAAC,EAAE;AAAA,EACtC;AAEA,MAAI,MAAM,MAAM,SAAS,GAAG;AAC1B,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,aAAW,QAAQ,MAAM,OAAO;AAC9B,UAAM,KAAK,OAAO,WAAW,IAAI,CAAC,EAAE;AAAA,EACtC;AAEA,QAAM,KAAK,GAAG;AAEd,SAAO,MAAM,KAAK,IAAI;AACxB;AAIA,SAAS,WAAW,MAAyB;AAC3C,QAAM,QAAgC;AAAA,IACpC,OAAO,KAAK;AAAA,IACZ,OAAO,KAAK;AAAA,IACZ,OAAO,KAAK,QAAQ,WAAW,KAAK,KAAK,MAAM;AAAA,IAC/C,WAAW,KAAK;AAAA,IAChB,OAAO,KAAK;AAAA,IACZ,UAAU,OAAO,KAAK,QAAQ;AAAA,EAChC;AAEA,MAAI,KAAK,WAAW,QAAW;AAC7B,UAAM,QAAQ,IAAI,OAAO,KAAK,MAAM;AAAA,EACtC;AACA,MAAI,KAAK,UAAU,QAAW;AAC5B,UAAM,OAAO,IAAI,OAAO,KAAK,KAAK;AAAA,EACpC;AAGA,MAAI,KAAK,OAAO;AACd,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AACrD,YAAM,GAAG,IAAI;AAAA,IACf;AAAA,EACF;AAEA,SAAO,GAAG,QAAQ,KAAK,EAAE,CAAC,KAAK,gBAAgB,KAAK,CAAC;AACvD;AAEA,SAAS,WAAW,MAAyB;AAC3C,QAAM,QAAgC;AAAA,IACpC,OAAO,KAAK;AAAA,IACZ,OAAO,KAAK;AAAA,IACZ,WAAW,KAAK;AAAA,EAClB;AAEA,MAAI,KAAK,UAAU,QAAW;AAC5B,UAAM,OAAO,IAAI,KAAK;AAAA,EACxB;AACA,MAAI,KAAK,aAAa,QAAW;AAC/B,UAAM,UAAU,IAAI,OAAO,KAAK,QAAQ;AAAA,EAC1C;AAGA,MAAI,KAAK,OAAO;AACd,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AACrD,YAAM,GAAG,IAAI;AAAA,IACf;AAAA,EACF;AAEA,SAAO,GAAG,QAAQ,KAAK,IAAI,CAAC,OAAO,QAAQ,KAAK,EAAE,CAAC,KAAK,gBAAgB,KAAK,CAAC;AAChF;AAEA,SAAS,eAAe,IAAc,QAA0B;AAC9D,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,GAAG,MAAM,YAAY,QAAQ,aAAa,GAAG,EAAE,CAAC,IAAI;AAE/D,MAAI,GAAG,UAAU,QAAW;AAC1B,UAAM,KAAK,GAAG,MAAM,aAAa,UAAU,GAAG,KAAK,CAAC,GAAG;AAAA,EACzD;AAEA,MAAI,GAAG,OAAO;AACZ,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,GAAG,KAAK,GAAG;AACnD,YAAM,KAAK,GAAG,MAAM,OAAO,GAAG,IAAI,UAAU,KAAK,CAAC,GAAG;AAAA,IACvD;AAAA,EACF;AAEA,aAAW,QAAQ,GAAG,OAAO;AAC3B,UAAM,KAAK,GAAG,MAAM,OAAO,WAAW,IAAI,CAAC,EAAE;AAAA,EAC/C;AAEA,QAAM,KAAK,GAAG,MAAM,GAAG;AACvB,SAAO;AACT;AAKA,SAAS,QAAQ,IAAoB;AAEnC,MAAI,2BAA2B,KAAK,EAAE,KAAK,CAAC,aAAa,EAAE,GAAG;AAC5D,WAAO;AAAA,EACT;AACA,SAAO,IAAI,UAAU,EAAE,CAAC;AAC1B;AAGA,SAAS,UAAU,OAAuB;AAExC,MAAI,kBAAkB,KAAK,KAAK,GAAG;AACjC,WAAO;AAAA,EACT;AACA,SAAO,IAAI,UAAU,KAAK,CAAC;AAC7B;AAGA,SAAS,UAAU,GAAmB;AACpC,SAAO,EAAE,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK;AACrD;AAMA,SAAS,gBAAgB,OAAuC;AAC9D,SAAO,OAAO,QAAQ,KAAK,EACxB,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM;AAErB,QAAI,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,GAAG;AAChD,aAAO,GAAG,GAAG,IAAI,KAAK;AAAA,IACxB;AACA,WAAO,GAAG,GAAG,IAAI,UAAU,KAAK,CAAC;AAAA,EACnC,CAAC,EACA,KAAK,IAAI;AACd;AAGA,SAAS,YAAY,OAAiD;AACpE,SAAO,OAAO,QAAQ,KAAK,EACxB,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,GAAG,GAAG,IAAI,UAAU,KAAK,CAAC,EAAE,EAClD,KAAK,IAAI;AACd;AAGA,SAAS,aAAa,IAAqB;AACzC,QAAM,QAAQ,GAAG,YAAY;AAC7B,SAAO,UAAU,WAAW,UAAU,aAAa,UAAU,cACxD,UAAU,UAAU,UAAU,UAAU,UAAU;AACzD;;;AC5KO,SAAS,UAAU,KAAe,QAA4B;AACnE,SAAO,UAAU,WAAW,KAAK,MAAM,CAAC;AAC1C;","names":[]}

package/dist/chunk-VQ4XMJTD.js

@@ -1,107 +0,0 @@
-// src/core/out.ts
-function and(...children) {
-  if (children.length === 0) {
-    throw new Error("AND requires at least 1 child");
-  }
-  return { type: "and", children };
-}
-function andPlaces(...places) {
-  return and(...places.map(outPlace));
-}
-function xor(...children) {
-  if (children.length < 2) {
-    throw new Error("XOR requires at least 2 children");
-  }
-  return { type: "xor", children };
-}
-function xorPlaces(...places) {
-  return xor(...places.map(outPlace));
-}
-function outPlace(p) {
-  return { type: "place", place: p };
-}
-function timeout(afterMs, child) {
-  if (afterMs <= 0) {
-    throw new Error(`Timeout must be positive: ${afterMs}`);
-  }
-  return { type: "timeout", afterMs, child };
-}
-function timeoutPlace(afterMs, p) {
-  return timeout(afterMs, outPlace(p));
-}
-function forwardInput(from, to) {
-  return { type: "forward-input", from, to };
-}
-function allPlaces(out) {
-  const result = /* @__PURE__ */ new Set();
-  collectPlaces(out, result);
-  return result;
-}
-function collectPlaces(out, result) {
-  switch (out.type) {
-    case "place":
-      result.add(out.place);
-      break;
-    case "forward-input":
-      result.add(out.to);
-      break;
-    case "and":
-    case "xor":
-      for (const child of out.children) {
-        collectPlaces(child, result);
-      }
-      break;
-    case "timeout":
-      collectPlaces(out.child, result);
-      break;
-  }
-}
-function enumerateBranches(out) {
-  switch (out.type) {
-    case "place":
-      return [/* @__PURE__ */ new Set([out.place])];
-    case "forward-input":
-      return [/* @__PURE__ */ new Set([out.to])];
-    case "and": {
-      let result = [/* @__PURE__ */ new Set()];
-      for (const child of out.children) {
-        result = crossProduct(result, enumerateBranches(child));
-      }
-      return result;
-    }
-    case "xor": {
-      const result = [];
-      for (const child of out.children) {
-        result.push(...enumerateBranches(child));
-      }
-      return result;
-    }
-    case "timeout":
-      return enumerateBranches(out.child);
-  }
-}
-function crossProduct(a, b) {
-  const result = [];
-  for (const setA of a) {
-    for (const setB of b) {
-      const merged = new Set(setA);
-      for (const p of setB) merged.add(p);
-      result.push(merged);
-    }
-  }
-  return result;
-}
-
-export {
-  and,
-  andPlaces,
-  xor,
-  xorPlaces,
-  outPlace,
-  timeout,
-  timeoutPlace,
-  forwardInput,
-  allPlaces,
-  enumerateBranches
-};
-//# sourceMappingURL=chunk-VQ4XMJTD.js.map

package/dist/chunk-VQ4XMJTD.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/core/out.ts"],"sourcesContent":["import type { Place } from './place.js';\n\n/**\n * Output specification with explicit split semantics.\n * Supports composite structures (XOR of ANDs, AND of XORs, etc.)\n *\n * - And: ALL children must receive tokens\n * - Xor: EXACTLY ONE child receives token\n * - Place: Leaf node representing a single output place\n * - Timeout: Timeout branch that activates if action exceeds duration\n * - ForwardInput: Forward consumed input to output on timeout\n */\nexport type Out = OutAnd | OutXor | OutPlace | OutTimeout | OutForwardInput;\n\nexport interface OutAnd {\n  readonly type: 'and';\n  readonly children: readonly Out[];\n}\n\nexport interface OutXor {\n  readonly type: 'xor';\n  readonly children: readonly Out[];\n}\n\nexport interface OutPlace {\n  readonly type: 'place';\n  readonly place: Place<any>;\n}\n\nexport interface OutTimeout {\n  readonly type: 'timeout';\n  /** Timeout duration in milliseconds. */\n  readonly afterMs: number;\n  readonly child: Out;\n}\n\nexport interface OutForwardInput {\n  readonly type: 'forward-input';\n  readonly from: Place<any>;\n  readonly to: Place<any>;\n}\n\n// ==================== Factory Functions ====================\n\n/**\n * AND-split: all children must receive tokens.\n *\n * @example\n * ```ts\n * // AND of XOR branches: one of (A,B) AND one of (C,D)\n * and(xorPlaces(placeA, placeB), xorPlaces(placeC, placeD))\n *\n * // AND with a fixed place + XOR branch\n * and(outPlace(always), xorPlaces(left, right))\n * ```\n */\nexport function and(...children: Out[]): OutAnd {\n  if (children.length === 0) {\n    throw new Error('AND requires at least 1 child');\n  }\n  return { type: 'and', children };\n}\n\n/** AND-split from places: all places must receive tokens. */\nexport function andPlaces(...places: Place<any>[]): OutAnd {\n  return and(...places.map(outPlace));\n}\n\n/** XOR-split: exactly one child receives token. */\nexport function xor(...children: Out[]): OutXor {\n  if (children.length < 2) {\n    throw new Error('XOR requires at least 2 children');\n  }\n  return { type: 'xor', children };\n}\n\n/** XOR-split from places: exactly one place receives token. */\nexport function xorPlaces(...places: Place<any>[]): OutXor {\n  return xor(...places.map(outPlace));\n}\n\n/** Leaf output spec for a single place. */\nexport function outPlace(p: Place<any>): OutPlace {\n  return { type: 'place', place: p };\n}\n\n/** Timeout output: activates if action exceeds duration. */\nexport function timeout(afterMs: number, child: Out): OutTimeout {\n  if (afterMs <= 0) {\n    throw new Error(`Timeout must be positive: ${afterMs}`);\n  }\n  return { type: 'timeout', afterMs, child };\n}\n\n/** Timeout output pointing to a single place. */\nexport function timeoutPlace(afterMs: number, p: Place<any>): OutTimeout {\n  return timeout(afterMs, outPlace(p));\n}\n\n/** Forward consumed input value to output place on timeout. */\nexport function forwardInput(from: Place<any>, to: Place<any>): OutForwardInput {\n  return { type: 'forward-input', from, to };\n}\n\n// ==================== Helper Functions ====================\n\n/** Collects all leaf places from this output spec (flattened). */\nexport function allPlaces(out: Out): Set<Place<any>> {\n  const result = new Set<Place<any>>();\n  collectPlaces(out, result);\n  return result;\n}\n\nfunction collectPlaces(out: Out, result: Set<Place<any>>): void {\n  switch (out.type) {\n    case 'place':\n      result.add(out.place);\n      break;\n    case 'forward-input':\n      result.add(out.to);\n      break;\n    case 'and':\n    case 'xor':\n      for (const child of out.children) {\n        collectPlaces(child, result);\n      }\n      break;\n    case 'timeout':\n      collectPlaces(out.child, result);\n      break;\n  }\n}\n\n/**\n * Enumerates all possible output branches for structural analysis.\n *\n * - AND = single branch containing all child places (Cartesian product)\n * - XOR = one branch per alternative child\n * - Nested = Cartesian product for AND, union for XOR\n */\nexport function enumerateBranches(out: Out): ReadonlyArray<ReadonlySet<Place<any>>> {\n  switch (out.type) {\n    case 'place':\n      return [new Set([out.place])];\n\n    case 'forward-input':\n      return [new Set<Place<any>>([out.to])];\n\n    case 'and': {\n      let result: Set<Place<any>>[] = [new Set()];\n      for (const child of out.children) {\n        result = crossProduct(result, enumerateBranches(child) as Set<Place<any>>[]);\n      }\n      return result;\n    }\n\n    case 'xor': {\n      const result: Set<Place<any>>[] = [];\n      for (const child of out.children) {\n        result.push(...(enumerateBranches(child) as Set<Place<any>>[]));\n      }\n      return result;\n    }\n\n    case 'timeout':\n      return enumerateBranches(out.child);\n  }\n}\n\nfunction crossProduct(\n  a: Set<Place<any>>[],\n  b: ReadonlyArray<ReadonlySet<Place<any>>>,\n): Set<Place<any>>[] {\n  const result: Set<Place<any>>[] = [];\n  for (const setA of a) {\n    for (const setB of b) {\n      const merged = new Set<Place<any>>(setA);\n      for (const p of setB) merged.add(p);\n      result.push(merged);\n    }\n  }\n  return result;\n}\n"],"mappings":";AAwDO,SAAS,OAAO,UAAyB;AAC9C,MAAI,SAAS,WAAW,GAAG;AACzB,UAAM,IAAI,MAAM,+BAA+B;AAAA,EACjD;AACA,SAAO,EAAE,MAAM,OAAO,SAAS;AACjC;AAGO,SAAS,aAAa,QAA8B;AACzD,SAAO,IAAI,GAAG,OAAO,IAAI,QAAQ,CAAC;AACpC;AAGO,SAAS,OAAO,UAAyB;AAC9C,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,IAAI,MAAM,kCAAkC;AAAA,EACpD;AACA,SAAO,EAAE,MAAM,OAAO,SAAS;AACjC;AAGO,SAAS,aAAa,QAA8B;AACzD,SAAO,IAAI,GAAG,OAAO,IAAI,QAAQ,CAAC;AACpC;AAGO,SAAS,SAAS,GAAyB;AAChD,SAAO,EAAE,MAAM,SAAS,OAAO,EAAE;AACnC;AAGO,SAAS,QAAQ,SAAiB,OAAwB;AAC/D,MAAI,WAAW,GAAG;AAChB,UAAM,IAAI,MAAM,6BAA6B,OAAO,EAAE;AAAA,EACxD;AACA,SAAO,EAAE,MAAM,WAAW,SAAS,MAAM;AAC3C;AAGO,SAAS,aAAa,SAAiB,GAA2B;AACvE,SAAO,QAAQ,SAAS,SAAS,CAAC,CAAC;AACrC;AAGO,SAAS,aAAa,MAAkB,IAAiC;AAC9E,SAAO,EAAE,MAAM,iBAAiB,MAAM,GAAG;AAC3C;AAKO,SAAS,UAAU,KAA2B;AACnD,QAAM,SAAS,oBAAI,IAAgB;AACnC,gBAAc,KAAK,MAAM;AACzB,SAAO;AACT;AAEA,SAAS,cAAc,KAAU,QAA+B;AAC9D,UAAQ,IAAI,MAAM;AAAA,IAChB,KAAK;AACH,aAAO,IAAI,IAAI,KAAK;AACpB;AAAA,IACF,KAAK;AACH,aAAO,IAAI,IAAI,EAAE;AACjB;AAAA,IACF,KAAK;AAAA,IACL,KAAK;AACH,iBAAW,SAAS,IAAI,UAAU;AAChC,sBAAc,OAAO,MAAM;AAAA,MAC7B;AACA;AAAA,IACF,KAAK;AACH,oBAAc,IAAI,OAAO,MAAM;AAC/B;AAAA,EACJ;AACF;AASO,SAAS,kBAAkB,KAAkD;AAClF,UAAQ,IAAI,MAAM;AAAA,IAChB,KAAK;AACH,aAAO,CAAC,oBAAI,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;AAAA,IAE9B,KAAK;AACH,aAAO,CAAC,oBAAI,IAAgB,CAAC,IAAI,EAAE,CAAC,CAAC;AAAA,IAEvC,KAAK,OAAO;AACV,UAAI,SAA4B,CAAC,oBAAI,IAAI,CAAC;AAC1C,iBAAW,SAAS,IAAI,UAAU;AAChC,iBAAS,aAAa,QAAQ,kBAAkB,KAAK,CAAsB;AAAA,MAC7E;AACA,aAAO;AAAA,IACT;AAAA,IAEA,KAAK,OAAO;AACV,YAAM,SAA4B,CAAC;AACnC,iBAAW,SAAS,IAAI,UAAU;AAChC,eAAO,KAAK,GAAI,kBAAkB,KAAK,CAAuB;AAAA,MAChE;AACA,aAAO;AAAA,IACT;AAAA,IAEA,KAAK;AACH,aAAO,kBAAkB,IAAI,KAAK;AAAA,EACtC;AACF;AAEA,SAAS,aACP,GACA,GACmB;AACnB,QAAM,SAA4B,CAAC;AACnC,aAAW,QAAQ,GAAG;AACpB,eAAW,QAAQ,GAAG;AACpB,YAAM,SAAS,IAAI,IAAgB,IAAI;AACvC,iBAAW,KAAK,KAAM,QAAO,IAAI,CAAC;AAClC,aAAO,KAAK,MAAM;AAAA,IACpB;AAAA,EACF;AACA,SAAO;AACT;","names":[]}

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

@@ -1,8 +0,0 @@
-import {
-  dotExport
-} from "./chunk-B2D5DMTO.js";
-import "./chunk-FN773SSE.js";
-export {
-  dotExport
-};
-//# sourceMappingURL=dot-exporter-3CVCH6J4.js.map