@stevenvo780/st-lang 4.2.0 → 4.3.0

package/dist/runtime/bayesian/inference.js

@@ -0,0 +1,260 @@
+"use strict";
+// ============================================================
+// Bayesian Inference — Algorithms
+// ============================================================
+//
+// - jointProbability: producto P(Xᵢ | parents(Xᵢ)) sobre asignación completa.
+// - variableElimination: P(Q | E) marginalizando variables no-evidencia.
+// - query: alias semántico de variableElimination.
+// - mostProbableExplanation: MAP/MPE sobre variables no-evidencia.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.jointProbability = jointProbability;
+exports.variableElimination = variableElimination;
+exports.query = query;
+exports.mostProbableExplanation = mostProbableExplanation;
+const factor_1 = require("./factor");
+// ── Validación ───────────────────────────────────────────────
+function indexCPTs(net) {
+    const m = new Map();
+    for (const c of net.cpts)
+        m.set(c.variable, c);
+    return m;
+}
+function assertVariableExists(net, name) {
+    if (!net.variables.some((v) => v.name === name)) {
+        throw new Error(`Variable "${name}" no existe en la red`);
+    }
+}
+function assertEvidenceValid(net, evidence) {
+    for (const [k, v] of Object.entries(evidence)) {
+        const dvar = net.variables.find((x) => x.name === k);
+        if (!dvar)
+            throw new Error(`Evidencia "${k}" no existe en la red`);
+        if (!dvar.values.includes(v)) {
+            throw new Error(`Evidencia "${k}=${v}" fuera del dominio [${dvar.values.join(', ')}]`);
+        }
+    }
+}
+// ── jointProbability ─────────────────────────────────────────
+function jointProbability(net, assignment) {
+    // Toda variable de la red debe estar asignada y dentro del dominio.
+    for (const v of net.variables) {
+        const val = assignment[v.name];
+        if (val === undefined) {
+            throw new Error(`Asignación incompleta: falta "${v.name}"`);
+        }
+        if (!v.values.includes(val)) {
+            throw new Error(`Valor "${val}" fuera del dominio de "${v.name}" [${v.values.join(', ')}]`);
+        }
+    }
+    const cptIndex = indexCPTs(net);
+    let p = 1;
+    for (const v of net.variables) {
+        const cpt = cptIndex.get(v.name);
+        if (!cpt)
+            throw new Error(`Sin CPT para "${v.name}"`);
+        const parentKey = (0, factor_1.buildParentKey)(cpt.parents, assignment);
+        const row = cpt.entries[parentKey];
+        if (!row) {
+            throw new Error(`CPT incompleta: falta fila "${parentKey}" para "${v.name}"`);
+        }
+        const prob = row[assignment[v.name]];
+        if (prob === undefined) {
+            throw new Error(`CPT incompleta: sin entrada para "${v.name}=${assignment[v.name]}"`);
+        }
+        p *= prob;
+    }
+    return p;
+}
+// ── Heurística de orden de eliminación ───────────────────────
+//
+// Min-fill simple: eliminar primero la variable cuya remoción
+// agrega menos aristas al gráfico residual. Implementación O(n²)
+// — suficiente para redes pequeñas. Para redes triviales con
+// pocas variables el costo es despreciable.
+function eliminationOrder(toEliminate, factors) {
+    const remaining = new Set(toEliminate);
+    const order = [];
+    const factorsAlive = factors.slice();
+    while (remaining.size > 0) {
+        let best = null;
+        let bestCost = Infinity;
+        for (const v of remaining) {
+            const involved = factorsAlive.filter((f) => f.variables.includes(v));
+            const merged = new Set();
+            for (const f of involved)
+                for (const x of f.variables)
+                    merged.add(x);
+            merged.delete(v);
+            const cost = merged.size; // proxy del tamaño del cluster
+            if (cost < bestCost) {
+                bestCost = cost;
+                best = v;
+            }
+        }
+        if (best === null)
+            break;
+        order.push(best);
+        remaining.delete(best);
+        // simular eliminación: reemplazar factores involucrados por uno fusionado
+        const involved = factorsAlive.filter((f) => f.variables.includes(best));
+        const others = factorsAlive.filter((f) => !f.variables.includes(best));
+        const mergedVars = new Set();
+        const mergedDomains = {};
+        for (const f of involved) {
+            for (const v of f.variables) {
+                if (v === best)
+                    continue;
+                mergedVars.add(v);
+                mergedDomains[v] = f.domains[v];
+            }
+        }
+        const fakeFactor = {
+            variables: Array.from(mergedVars).sort(),
+            domains: mergedDomains,
+            values: new Map(),
+        };
+        factorsAlive.length = 0;
+        factorsAlive.push(...others, fakeFactor);
+    }
+    return order;
+}
+// ── variableElimination ──────────────────────────────────────
+function variableElimination(net, queryVar, evidence = {}) {
+    assertVariableExists(net, queryVar);
+    assertEvidenceValid(net, evidence);
+    if (queryVar in evidence) {
+        // Si la query está observada, el posterior es degenerado.
+        const qDomain = net.variables.find((v) => v.name === queryVar).values;
+        const dist = {};
+        const out = {};
+        for (const val of qDomain)
+            out[val] = val === evidence[queryVar] ? 1 : 0;
+        void dist;
+        return { variable: queryVar, distribution: out };
+    }
+    const domains = (0, factor_1.variableDomainsOf)(net);
+    // 1. Construir factores desde CPTs, restringidos por evidencia.
+    let factors = net.cpts.map((cpt) => {
+        const f = (0, factor_1.factorFromCPT)(cpt, domains);
+        return (0, factor_1.restrictFactor)(f, evidence);
+    });
+    // 2. Determinar variables a eliminar (todas menos query y evidencia).
+    const toEliminate = net.variables
+        .map((v) => v.name)
+        .filter((n) => n !== queryVar && !(n in evidence));
+    const order = eliminationOrder(toEliminate, factors);
+    // 3. Eliminar cada variable: multiplicar todos los factores que la contengan
+    //    y sumar-marginalizar.
+    for (const v of order) {
+        const involved = factors.filter((f) => f.variables.includes(v));
+        const others = factors.filter((f) => !f.variables.includes(v));
+        if (involved.length === 0)
+            continue;
+        let product = involved[0];
+        for (let i = 1; i < involved.length; i++) {
+            product = (0, factor_1.multiplyFactors)(product, involved[i]);
+        }
+        const reduced = (0, factor_1.sumOut)(product, v);
+        factors = [...others, reduced];
+    }
+    // 4. Multiplicar los factores restantes (todos sobre queryVar tras la elim).
+    let result = factors[0];
+    for (let i = 1; i < factors.length; i++) {
+        result = (0, factor_1.multiplyFactors)(result, factors[i]);
+    }
+    // 5. Normalizar.
+    const normalized = (0, factor_1.normalizeFactor)(result);
+    // 6. Extraer la distribución sobre la query.
+    const distribution = {};
+    const qDomain = net.variables.find((v) => v.name === queryVar).values;
+    for (const val of qDomain) {
+        const key = (0, factor_1.assignmentKey)([queryVar], { [queryVar]: val });
+        distribution[val] = normalized.values.get(key) ?? 0;
+    }
+    return { variable: queryVar, distribution };
+}
+// ── query (alias semántico) ──────────────────────────────────
+function query(net, queryVar, evidence = {}) {
+    return variableElimination(net, queryVar, evidence);
+}
+// ── Most Probable Explanation (MPE / MAP completo) ───────────
+//
+// Devuelve la asignación de máxima probabilidad sobre todas las
+// variables no observadas, dada la evidencia. Implementación:
+// max-product variable elimination con tracking de backpointers.
+function mostProbableExplanation(net, evidence = {}) {
+    assertEvidenceValid(net, evidence);
+    const domains = (0, factor_1.variableDomainsOf)(net);
+    let factors = net.cpts.map((cpt) => {
+        const f = (0, factor_1.factorFromCPT)(cpt, domains);
+        return (0, factor_1.restrictFactor)(f, evidence);
+    });
+    const toEliminate = net.variables.map((v) => v.name).filter((n) => !(n in evidence));
+    // Para reconstruir el argmax necesitamos eliminar en un orden
+    // determinístico y guardar, en cada paso, la mejor asignación
+    // de la variable eliminada como función de las restantes.
+    const order = eliminationOrder(toEliminate, factors);
+    const steps = [];
+    for (const v of order) {
+        const involved = factors.filter((f) => f.variables.includes(v));
+        const others = factors.filter((f) => !f.variables.includes(v));
+        if (involved.length === 0)
+            continue;
+        let product = involved[0];
+        for (let i = 1; i < involved.length; i++) {
+            product = (0, factor_1.multiplyFactors)(product, involved[i]);
+        }
+        const contextVars = product.variables.filter((x) => x !== v);
+        // Construir chooser: para cada asignación de contextVars,
+        // qué valor de v maximiza el producto.
+        const chooser = new Map();
+        const best = new Map();
+        for (const [key, val] of product.values) {
+            const assign = (0, factor_1.parseAssignmentKey)(key);
+            const ctx = {};
+            for (const c of contextVars)
+                ctx[c] = assign[c];
+            const ctxKey = (0, factor_1.assignmentKey)(contextVars, ctx);
+            const prev = best.get(ctxKey);
+            if (prev === undefined || val > prev) {
+                best.set(ctxKey, val);
+                chooser.set(ctxKey, assign[v]);
+            }
+        }
+        steps.push({ variable: v, contextVars, chooser });
+        const { factor: reduced } = (0, factor_1.maxOut)(product, v);
+        factors = [...others, reduced];
+    }
+    // Tras eliminar todas las variables no-evidencia, queda un
+    // factor escalar (sin variables). La asignación óptima se
+    // reconstruye recorriendo `steps` en orden inverso.
+    const assignment = { ...evidence };
+    for (let i = steps.length - 1; i >= 0; i--) {
+        const step = steps[i];
+        const ctx = {};
+        for (const c of step.contextVars) {
+            const val = assignment[c];
+            if (val === undefined) {
+                // No debería ocurrir si el orden es válido — defensa.
+                ctx[c] = '';
+            }
+            else {
+                ctx[c] = val;
+            }
+        }
+        const ctxKey = (0, factor_1.assignmentKey)(step.contextVars, ctx);
+        const chosen = step.chooser.get(ctxKey);
+        if (chosen !== undefined) {
+            assignment[step.variable] = chosen;
+        }
+        else {
+            // Fallback: primer valor del dominio. Solo posible con CPT degenerada.
+            const dom = domains[step.variable];
+            if (dom && dom.length > 0)
+                assignment[step.variable] = dom[0];
+        }
+    }
+    return assignment;
+}
+//# sourceMappingURL=inference.js.map

package/dist/runtime/bayesian/inference.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inference.js","sourceRoot":"","sources":["../../../src/runtime/bayesian/inference.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,kCAAkC;AAClC,+DAA+D;AAC/D,EAAE;AACF,8EAA8E;AAC9E,yEAAyE;AACzE,mDAAmD;AACnD,mEAAmE;;AA2CnE,4CA4BC;AAuDD,kDAuDC;AAID,sBAMC;AAQD,0DA4EC;AAjRD,qCAYkB;AAGlB,gEAAgE;AAEhE,SAAS,SAAS,CAAC,GAAoB;IACrC,MAAM,CAAC,GAAG,IAAI,GAAG,EAAe,CAAC;IACjC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI;QAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC/C,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,oBAAoB,CAAC,GAAoB,EAAE,IAAY;IAC9D,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QAChD,MAAM,IAAI,KAAK,CAAC,aAAa,IAAI,uBAAuB,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAAC,GAAoB,EAAE,QAAkB;IACnE,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;QACrD,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,uBAAuB,CAAC,CAAC;QACnE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,wBAAwB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;AACH,CAAC;AAED,gEAAgE;AAEhE,SAAgB,gBAAgB,CAAC,GAAoB,EAAE,UAAkC;IACvF,oEAAoE;IACpE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,UAAU,GAAG,2BAA2B,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9F,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QACtD,MAAM,SAAS,GAAG,IAAA,uBAAc,EAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QAC1D,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,IAAI,KAAK,CAAC,+BAA+B,SAAS,WAAW,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAChF,CAAC;QACD,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACrC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC,IAAI,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxF,CAAC;QACD,CAAC,IAAI,IAAI,CAAC;IACZ,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,gEAAgE;AAChE,EAAE;AACF,8DAA8D;AAC9D,iEAAiE;AACjE,6DAA6D;AAC7D,4CAA4C;AAE5C,SAAS,gBAAgB,CAAC,WAAqB,EAAE,OAAiB;IAChE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;IACvC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IACrC,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC1B,IAAI,IAAI,GAAkB,IAAI,CAAC;QAC/B,IAAI,QAAQ,GAAG,QAAQ,CAAC;QACxB,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACrE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;YACjC,KAAK,MAAM,CAAC,IAAI,QAAQ;gBAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS;oBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACjB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,+BAA+B;YACzD,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;gBACpB,QAAQ,GAAG,IAAI,CAAC;gBAChB,IAAI,GAAG,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QACD,IAAI,IAAI,KAAK,IAAI;YAAE,MAAM;QACzB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvB,0EAA0E;QAC1E,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QACxE,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QACvE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QACrC,MAAM,aAAa,GAA6B,EAAE,CAAC;QACnD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;gBAC5B,IAAI,CAAC,KAAK,IAAI;oBAAE,SAAS;gBACzB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAClB,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;YACnC,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAW;YACzB,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,EAAE;YACxC,OAAO,EAAE,aAAa;YACtB,MAAM,EAAE,IAAI,GAAG,EAAE;SAClB,CAAC;QACF,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,YAAY,CAAC,IAAI,CAAC,GAAG,MAAM,EAAE,UAAU,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,gEAAgE;AAEhE,SAAgB,mBAAmB,CACjC,GAAoB,EACpB,QAAgB,EAChB,WAAqB,EAAE;IAEvB,oBAAoB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IACpC,mBAAmB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IACnC,IAAI,QAAQ,IAAI,QAAQ,EAAE,CAAC;QACzB,0DAA0D;QAC1D,MAAM,OAAO,GAAG,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAE,CAAC,MAAM,CAAC;QACvE,MAAM,IAAI,GAAoD,EAAE,CAAC;QACjE,MAAM,GAAG,GAA2B,EAAE,CAAC;QACvC,KAAK,MAAM,GAAG,IAAI,OAAO;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,KAAK,IAAI,CAAC;QACV,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC;IACnD,CAAC;IACD,MAAM,OAAO,GAAG,IAAA,0BAAiB,EAAC,GAAG,CAAC,CAAC;IACvC,gEAAgE;IAChE,IAAI,OAAO,GAAa,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAC3C,MAAM,CAAC,GAAG,IAAA,sBAAa,EAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACtC,OAAO,IAAA,uBAAc,EAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IACH,sEAAsE;IACtE,MAAM,WAAW,GAAG,GAAG,CAAC,SAAS;SAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IACrD,MAAM,KAAK,GAAG,gBAAgB,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IACrD,6EAA6E;IAC7E,2BAA2B;IAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACpC,IAAI,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,OAAO,GAAG,IAAA,wBAAe,EAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,MAAM,OAAO,GAAG,IAAA,eAAM,EAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACnC,OAAO,GAAG,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,CAAC;IACD,6EAA6E;IAC7E,IAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,GAAG,IAAA,wBAAe,EAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,iBAAiB;IACjB,MAAM,UAAU,GAAG,IAAA,wBAAe,EAAC,MAAM,CAAC,CAAC;IAC3C,6CAA6C;IAC7C,MAAM,YAAY,GAA2B,EAAE,CAAC;IAChD,MAAM,OAAO,GAAG,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAE,CAAC,MAAM,CAAC;IACvE,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,IAAA,sBAAa,EAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QAC3D,YAAY,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC;AAC9C,CAAC;AAED,gEAAgE;AAEhE,SAAgB,KAAK,CACnB,GAAoB,EACpB,QAAgB,EAChB,WAAqB,EAAE;IAEvB,OAAO,mBAAmB,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;AACtD,CAAC;AAED,gEAAgE;AAChE,EAAE;AACF,gEAAgE;AAChE,8DAA8D;AAC9D,iEAAiE;AAEjE,SAAgB,uBAAuB,CACrC,GAAoB,EACpB,WAAqB,EAAE;IAEvB,mBAAmB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,IAAA,0BAAiB,EAAC,GAAG,CAAC,CAAC;IACvC,IAAI,OAAO,GAAa,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAC3C,MAAM,CAAC,GAAG,IAAA,sBAAa,EAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACtC,OAAO,IAAA,uBAAc,EAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IACH,MAAM,WAAW,GAAG,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IACrF,8DAA8D;IAC9D,8DAA8D;IAC9D,0DAA0D;IAC1D,MAAM,KAAK,GAAG,gBAAgB,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IAMrD,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACpC,IAAI,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,OAAO,GAAG,IAAA,wBAAe,EAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,MAAM,WAAW,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7D,0DAA0D;QAC1D,uCAAuC;QACvC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,IAAA,2BAAkB,EAAC,GAAG,CAAC,CAAC;YACvC,MAAM,GAAG,GAA2B,EAAE,CAAC;YACvC,KAAK,MAAM,CAAC,IAAI,WAAW;gBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;YACjD,MAAM,MAAM,GAAG,IAAA,sBAAa,EAAC,WAAW,EAAE,GAAG,CAAC,CAAC;YAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC9B,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;gBACrC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;gBACtB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC,CAAC;QAClD,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,IAAA,eAAM,EAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAC/C,OAAO,GAAG,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,CAAC;IACD,2DAA2D;IAC3D,0DAA0D;IAC1D,oDAAoD;IACpD,MAAM,UAAU,GAA2B,EAAE,GAAG,QAAQ,EAAE,CAAC;IAC3D,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,GAAG,GAA2B,EAAE,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACjC,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACtB,sDAAsD;gBACtD,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACd,CAAC;iBAAM,CAAC;gBACN,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACf,CAAC;QACH,CAAC;QACD,MAAM,MAAM,GAAG,IAAA,sBAAa,EAAC,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC;QACrC,CAAC;aAAM,CAAC;YACN,uEAAuE;YACvE,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACnC,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;gBAAE,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;QACjE,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/runtime/bayesian/types.d.ts

@@ -0,0 +1,19 @@
+export interface DiscreteVariable {
+    name: string;
+    values: string[];
+}
+export interface CPT {
+    variable: string;
+    parents: string[];
+    entries: Record<string, Record<string, number>>;
+}
+export interface BayesianNetwork {
+    variables: DiscreteVariable[];
+    cpts: CPT[];
+}
+export type Evidence = Record<string, string>;
+export interface PosteriorDistribution {
+    variable: string;
+    distribution: Record<string, number>;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/runtime/bayesian/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/runtime/bayesian/types.ts"],"names":[],"mappings":"AAOA,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,WAAW,GAAG;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;IAGlB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;CACjD;AAED,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,gBAAgB,EAAE,CAAC;IAC9B,IAAI,EAAE,GAAG,EAAE,CAAC;CACb;AAED,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAE9C,MAAM,WAAW,qBAAqB;IACpC,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACtC"}

package/dist/runtime/bayesian/types.js

@@ -0,0 +1,9 @@
+"use strict";
+// ============================================================
+// Bayesian Inference — Types
+// ============================================================
+//
+// Tipos para representar redes bayesianas discretas y consultas
+// de inferencia probabilística.
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/runtime/bayesian/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/runtime/bayesian/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6BAA6B;AAC7B,+DAA+D;AAC/D,EAAE;AACF,gEAAgE;AAChE,gCAAgC"}

package/dist/runtime/bisimulation/index.d.ts

@@ -0,0 +1,4 @@
+export type { LTS, BisimulationResult } from './types';
+export { paigeTarjan } from './paige-tarjan';
+export { areBisimilar, quotientLTS, strongBisimulation, weakBisimulation } from './operations';
+//# sourceMappingURL=index.d.ts.map

package/dist/runtime/bisimulation/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/runtime/bisimulation/index.ts"],"names":[],"mappings":"AAWA,YAAY,EAAE,GAAG,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AACvD,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC"}

package/dist/runtime/bisimulation/index.js

@@ -0,0 +1,21 @@
+"use strict";
+// ============================================================
+// ST Bisimulation — barrel público.
+// ============================================================
+// API:
+//   paigeTarjan(lts)              → BisimulationResult
+//   areBisimilar(lts, s, t)       → boolean
+//   quotientLTS(lts)              → LTS mínimo módulo ~
+//   strongBisimulation(L1, L2)    → boolean
+//   weakBisimulation(lts, tau)    → BisimulationResult (oculta τ)
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.weakBisimulation = exports.strongBisimulation = exports.quotientLTS = exports.areBisimilar = exports.paigeTarjan = void 0;
+var paige_tarjan_1 = require("./paige-tarjan");
+Object.defineProperty(exports, "paigeTarjan", { enumerable: true, get: function () { return paige_tarjan_1.paigeTarjan; } });
+var operations_1 = require("./operations");
+Object.defineProperty(exports, "areBisimilar", { enumerable: true, get: function () { return operations_1.areBisimilar; } });
+Object.defineProperty(exports, "quotientLTS", { enumerable: true, get: function () { return operations_1.quotientLTS; } });
+Object.defineProperty(exports, "strongBisimulation", { enumerable: true, get: function () { return operations_1.strongBisimulation; } });
+Object.defineProperty(exports, "weakBisimulation", { enumerable: true, get: function () { return operations_1.weakBisimulation; } });
+//# sourceMappingURL=index.js.map

package/dist/runtime/bisimulation/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/runtime/bisimulation/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,oCAAoC;AACpC,+DAA+D;AAC/D,OAAO;AACP,uDAAuD;AACvD,4CAA4C;AAC5C,wDAAwD;AACxD,4CAA4C;AAC5C,kEAAkE;AAClE,+DAA+D;;;AAG/D,+CAA6C;AAApC,2GAAA,WAAW,OAAA;AACpB,2CAA+F;AAAtF,0GAAA,YAAY,OAAA;AAAE,yGAAA,WAAW,OAAA;AAAE,gHAAA,kBAAkB,OAAA;AAAE,8GAAA,gBAAgB,OAAA"}

package/dist/runtime/bisimulation/operations.d.ts

@@ -0,0 +1,40 @@
+import type { LTS, BisimulationResult } from './types';
+/**
+ * Devuelve `true` si los estados `s` y `t` caen en el mismo bloque de la
+ * partición de bisimulación fuerte. Lanza si alguno no existe en M.
+ */
+export declare function areBisimilar(lts: LTS, s: string, t: string): boolean;
+/**
+ * Construye el LTS cociente M/~ donde cada bloque de la partición de
+ * bisimulación se convierte en un único estado. Las transiciones se
+ * deduplican: si s -a-> t, entonces [s] -a-> [t] aparece una sola vez.
+ *
+ * El labelling del bloque es el labelling común de sus miembros
+ * (todos los miembros tienen el mismo labelling por construcción).
+ */
+export declare function quotientLTS(lts: LTS): LTS;
+/**
+ * Verifica si dos LTS son fuertemente bisimilares.
+ * Los espacios de estados deben ser disjuntos; si no lo son, los renombramos
+ * internamente con prefijos "L:" y "R:".
+ *
+ * El criterio: en el LTS combinado, los conjuntos iniciales (o, en ausencia
+ * de iniciales explícitos, todos los estados) deben quedar particionados de
+ * forma que cada estado de L tenga al menos un estado equivalente en R y
+ * viceversa. Como API simple, se compara la firma de la partición sobre
+ * el LTS combinado: dos LTS son bisimilares como sistemas sii existe una
+ * biyección entre sus bloques tal que cada bloque contiene estados de ambos
+ * lados (interpretación de "los autómatas son indistinguibles").
+ */
+export declare function strongBisimulation(lts1: LTS, lts2: LTS): boolean;
+/**
+ * Bisimulación débil: oculta transiciones τ y satura ⇒ = τ* antes de aplicar
+ * Paige-Tarjan. Útil para CCS / process algebras donde τ representa una
+ * acción interna no observable.
+ *
+ * Cuesta O(n³) por la saturación (transitivos τ); para LTS grandes con muchas
+ * acciones reales esto es aceptable. La partición resultante es la mayor
+ * relación de bisimulación débil.
+ */
+export declare function weakBisimulation(lts: LTS, tau: string): BisimulationResult;
+//# sourceMappingURL=operations.d.ts.map

package/dist/runtime/bisimulation/operations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"operations.d.ts","sourceRoot":"","sources":["../../../src/runtime/bisimulation/operations.ts"],"names":[],"mappings":"AAqBA,OAAO,KAAK,EAAE,GAAG,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AAEvD;;;GAGG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAMpE;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,CAsCzC;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO,CA8ChE;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,GAAG,kBAAkB,CA6D1E"}

package/dist/runtime/bisimulation/operations.js

@@ -0,0 +1,219 @@
+"use strict";
+// ============================================================
+// Operaciones derivadas sobre bisimulación.
+// ============================================================
+//   - areBisimilar(M, s, t)       : ¿s y t están en el mismo bloque?
+//   - quotientLTS(M)              : LTS mínimo módulo bisimulación.
+//   - strongBisimulation(M1, M2)  : ¿dos LTS son fuertemente bisimilares?
+//   - weakBisimulation(M, τ)      : partición que oculta transiciones τ.
+//
+// Para weakBisimulation usamos la construcción estándar:
+//   1. saturar: ⇒ = τ* (con loops auto-incluidos)
+//   2. para cada arista s -a-> t con a ≠ τ, agregar todas las composiciones
+//      τ* ; a ; τ*
+//   3. para a = τ, agregar todos los pares (s, t) tales que s ⇒ t  (incluido
+//      el reflexivo) bajo la acción τ.
+//   4. Aplicar Paige-Tarjan sobre el LTS saturado.
+//
+// El resultado es la partición de bisimulación débil (~_w o "observational
+// equivalence" de Milner).
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.areBisimilar = areBisimilar;
+exports.quotientLTS = quotientLTS;
+exports.strongBisimulation = strongBisimulation;
+exports.weakBisimulation = weakBisimulation;
+const paige_tarjan_1 = require("./paige-tarjan");
+/**
+ * Devuelve `true` si los estados `s` y `t` caen en el mismo bloque de la
+ * partición de bisimulación fuerte. Lanza si alguno no existe en M.
+ */
+function areBisimilar(lts, s, t) {
+    const known = new Set(lts.states);
+    if (!known.has(s))
+        throw new Error(`areBisimilar: estado desconocido "${s}"`);
+    if (!known.has(t))
+        throw new Error(`areBisimilar: estado desconocido "${t}"`);
+    const result = (0, paige_tarjan_1.paigeTarjan)(lts);
+    return result.partition.get(s) === result.partition.get(t);
+}
+/**
+ * Construye el LTS cociente M/~ donde cada bloque de la partición de
+ * bisimulación se convierte en un único estado. Las transiciones se
+ * deduplican: si s -a-> t, entonces [s] -a-> [t] aparece una sola vez.
+ *
+ * El labelling del bloque es el labelling común de sus miembros
+ * (todos los miembros tienen el mismo labelling por construcción).
+ */
+function quotientLTS(lts) {
+    const result = (0, paige_tarjan_1.paigeTarjan)(lts);
+    const blockName = (idx) => `q${idx}`;
+    const newStates = result.blocks.map((_, i) => blockName(i));
+    const seen = new Set();
+    const newTransitions = [];
+    for (const [from, action, to] of lts.transitions) {
+        const bf = result.partition.get(from);
+        const bt = result.partition.get(to);
+        if (bf === undefined || bt === undefined)
+            continue;
+        const key = `${bf}|${action}|${bt}`;
+        if (seen.has(key))
+            continue;
+        seen.add(key);
+        newTransitions.push([blockName(bf), action, blockName(bt)]);
+    }
+    // Labelling: cada bloque hereda el labelling de cualquiera de sus miembros
+    // (los miembros de un mismo bloque coinciden en labelling por bisimulación).
+    const labelling = {};
+    if (lts.labelling) {
+        for (let i = 0; i < result.blocks.length; i++) {
+            const cell = result.blocks[i];
+            const rep = cell && cell.length > 0 ? cell[0] : undefined;
+            if (rep === undefined)
+                continue;
+            const labs = lts.labelling[rep];
+            if (labs && labs.size > 0) {
+                labelling[blockName(i)] = new Set(labs);
+            }
+        }
+    }
+    const out = {
+        states: newStates,
+        transitions: newTransitions,
+    };
+    if (Object.keys(labelling).length > 0)
+        out.labelling = labelling;
+    return out;
+}
+/**
+ * Verifica si dos LTS son fuertemente bisimilares.
+ * Los espacios de estados deben ser disjuntos; si no lo son, los renombramos
+ * internamente con prefijos "L:" y "R:".
+ *
+ * El criterio: en el LTS combinado, los conjuntos iniciales (o, en ausencia
+ * de iniciales explícitos, todos los estados) deben quedar particionados de
+ * forma que cada estado de L tenga al menos un estado equivalente en R y
+ * viceversa. Como API simple, se compara la firma de la partición sobre
+ * el LTS combinado: dos LTS son bisimilares como sistemas sii existe una
+ * biyección entre sus bloques tal que cada bloque contiene estados de ambos
+ * lados (interpretación de "los autómatas son indistinguibles").
+ */
+function strongBisimulation(lts1, lts2) {
+    const prefix = (side, s) => `${side}:${s}`;
+    const states = [
+        ...lts1.states.map((s) => prefix('L', s)),
+        ...lts2.states.map((s) => prefix('R', s)),
+    ];
+    const transitions = [
+        ...lts1.transitions.map(([f, a, t]) => [prefix('L', f), a, prefix('L', t)]),
+        ...lts2.transitions.map(([f, a, t]) => [prefix('R', f), a, prefix('R', t)]),
+    ];
+    const labelling = {};
+    if (lts1.labelling) {
+        for (const [k, v] of Object.entries(lts1.labelling)) {
+            labelling[prefix('L', k)] = new Set(v);
+        }
+    }
+    if (lts2.labelling) {
+        for (const [k, v] of Object.entries(lts2.labelling)) {
+            labelling[prefix('R', k)] = new Set(v);
+        }
+    }
+    const combined = { states, transitions };
+    if (Object.keys(labelling).length > 0)
+        combined.labelling = labelling;
+    const result = (0, paige_tarjan_1.paigeTarjan)(combined);
+    // Para que dos LTS sean "globalmente" bisimilares, cada estado de un lado
+    // debe quedar emparejado con al menos un estado del otro: los bloques deben
+    // contener miembros de ambos lados (o bloques que toquen sólo un lado son
+    // testigos de no-bisimilaridad).
+    for (const cell of result.blocks) {
+        let hasL = false;
+        let hasR = false;
+        for (const s of cell) {
+            if (s.startsWith('L:'))
+                hasL = true;
+            else if (s.startsWith('R:'))
+                hasR = true;
+            if (hasL && hasR)
+                break;
+        }
+        if (!hasL || !hasR)
+            return false;
+    }
+    return true;
+}
+/**
+ * Bisimulación débil: oculta transiciones τ y satura ⇒ = τ* antes de aplicar
+ * Paige-Tarjan. Útil para CCS / process algebras donde τ representa una
+ * acción interna no observable.
+ *
+ * Cuesta O(n³) por la saturación (transitivos τ); para LTS grandes con muchas
+ * acciones reales esto es aceptable. La partición resultante es la mayor
+ * relación de bisimulación débil.
+ */
+function weakBisimulation(lts, tau) {
+    const states = new Set(lts.states);
+    // Construir τ-reachability (incluyendo cero pasos: cada s alcanza a sí mismo).
+    const tauNext = new Map();
+    for (const s of states)
+        tauNext.set(s, new Set([s]));
+    for (const [f, a, t] of lts.transitions) {
+        if (a === tau)
+            tauNext.get(f)?.add(t);
+    }
+    // Cierre transitivo de τ (Floyd-Warshall ingenuo).
+    const tauStar = new Map();
+    for (const s of states) {
+        const reach = new Set([s]);
+        const queue = [s];
+        while (queue.length > 0) {
+            const cur = queue.shift();
+            if (cur === undefined)
+                continue;
+            for (const n of tauNext.get(cur) ?? []) {
+                if (!reach.has(n)) {
+                    reach.add(n);
+                    queue.push(n);
+                }
+            }
+        }
+        tauStar.set(s, reach);
+    }
+    // Saturación: s ⇒ -a-> ⇐ t  ≡ existen u, v con s ⇒ u -a-> v y v ⇒ t.
+    // Para τ: s ⇒ t (sólo cuando el LTS original tiene al menos un τ desde s o
+    // s ≠ t por algún camino) se traduce a aristas τ explícitas en el saturado.
+    const saturated = [];
+    const seen = new Set();
+    const addEdge = (f, a, t) => {
+        const k = `${f}|${a}|${t}`;
+        if (seen.has(k))
+            return;
+        seen.add(k);
+        saturated.push([f, a, t]);
+    };
+    // Saturación de transiciones observables (a ≠ τ):
+    //   en el LTS saturado, s -a-> u  sii existen f, t con s ⇒ f -a-> t ⇒ u.
+    // Los τ originales NO se emiten como aristas observables: se "absorben" en
+    // ⇒ y desaparecen de la firma local, que es la definición canónica de
+    // bisimulación débil de Milner.
+    for (const [f, a, t] of lts.transitions) {
+        if (a === tau)
+            continue;
+        for (const s of tauStar.keys()) {
+            if (!tauStar.get(s)?.has(f))
+                continue;
+            for (const u of tauStar.get(t) ?? []) {
+                addEdge(s, a, u);
+            }
+        }
+    }
+    const satLts = {
+        states: [...states],
+        transitions: saturated,
+    };
+    if (lts.labelling)
+        satLts.labelling = lts.labelling;
+    return (0, paige_tarjan_1.paigeTarjan)(satLts);
+}
+//# sourceMappingURL=operations.js.map

package/dist/runtime/bisimulation/operations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"operations.js","sourceRoot":"","sources":["../../../src/runtime/bisimulation/operations.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4CAA4C;AAC5C,+DAA+D;AAC/D,qEAAqE;AACrE,oEAAoE;AACpE,0EAA0E;AAC1E,yEAAyE;AACzE,EAAE;AACF,yDAAyD;AACzD,kDAAkD;AAClD,4EAA4E;AAC5E,mBAAmB;AACnB,6EAA6E;AAC7E,uCAAuC;AACvC,mDAAmD;AACnD,EAAE;AACF,2EAA2E;AAC3E,2BAA2B;AAC3B,+DAA+D;;AAS/D,oCAMC;AAUD,kCAsCC;AAeD,gDA8CC;AAWD,4CA6DC;AAlMD,iDAA6C;AAG7C;;;GAGG;AACH,SAAgB,YAAY,CAAC,GAAQ,EAAE,CAAS,EAAE,CAAS;IACzD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAClC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,GAAG,CAAC,CAAC;IAC9E,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,GAAG,CAAC,CAAC;IAC9E,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC;IAChC,OAAO,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,WAAW,CAAC,GAAQ;IAClC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC;IAChC,MAAM,SAAS,GAAG,CAAC,GAAW,EAAU,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;IAErD,MAAM,SAAS,GAAa,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,cAAc,GAAoC,EAAE,CAAC;IAC3D,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QACjD,MAAM,EAAE,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;YAAE,SAAS;QACnD,MAAM,GAAG,GAAG,GAAG,EAAE,IAAI,MAAM,IAAI,EAAE,EAAE,CAAC;QACpC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,cAAc,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED,2EAA2E;IAC3E,6EAA6E;IAC7E,MAAM,SAAS,GAAgC,EAAE,CAAC;IAClD,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,GAAG,GAAG,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC1D,IAAI,GAAG,KAAK,SAAS;gBAAE,SAAS;YAChC,MAAM,IAAI,GAAG,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAC1B,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAQ;QACf,MAAM,EAAE,SAAS;QACjB,WAAW,EAAE,cAAc;KAC5B,CAAC;IACF,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC;IACjE,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAgB,kBAAkB,CAAC,IAAS,EAAE,IAAS;IACrD,MAAM,MAAM,GAAG,CAAC,IAAe,EAAE,CAAS,EAAU,EAAE,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;IAEtE,MAAM,MAAM,GAAa;QACvB,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;KAC1C,CAAC;IACF,MAAM,WAAW,GAAoC;QACnD,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CACrB,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAA6B,CAC/E;QACD,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CACrB,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAA6B,CAC/E;KACF,CAAC;IACF,MAAM,SAAS,GAAgC,EAAE,CAAC;IAClD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QACnB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YACpD,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IACD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QACnB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YACpD,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IAC9C,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC;IAEtE,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,QAAQ,CAAC,CAAC;IAErC,0EAA0E;IAC1E,4EAA4E;IAC5E,0EAA0E;IAC1E,iCAAiC;IACjC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QACjC,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC;gBAAE,IAAI,GAAG,IAAI,CAAC;iBAC/B,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC;gBAAE,IAAI,GAAG,IAAI,CAAC;YACzC,IAAI,IAAI,IAAI,IAAI;gBAAE,MAAM;QAC1B,CAAC;QACD,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;IACnC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,gBAAgB,CAAC,GAAQ,EAAE,GAAW;IACpD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAEnC,+EAA+E;IAC/E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QACxC,IAAI,CAAC,KAAK,GAAG;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,mDAAmD;IACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,KAAK,GAAa,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC1B,IAAI,GAAG,KAAK,SAAS;gBAAE,SAAS;YAChC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACb,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACxB,CAAC;IAED,qEAAqE;IACrE,2EAA2E;IAC3E,4EAA4E;IAC5E,MAAM,SAAS,GAAoC,EAAE,CAAC;IACtD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,EAAE;QAClD,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO;QACxB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC;IAEF,kDAAkD;IAClD,yEAAyE;IACzE,2EAA2E;IAC3E,sEAAsE;IACtE,gCAAgC;IAChC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QACxC,IAAI,CAAC,KAAK,GAAG;YAAE,SAAS;QACxB,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YACtC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;gBACrC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAQ;QAClB,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC;QACnB,WAAW,EAAE,SAAS;KACvB,CAAC;IACF,IAAI,GAAG,CAAC,SAAS;QAAE,MAAM,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC;IACpD,OAAO,IAAA,0BAAW,EAAC,MAAM,CAAC,CAAC;AAC7B,CAAC"}

package/dist/runtime/bisimulation/paige-tarjan.d.ts

@@ -0,0 +1,8 @@
+import type { LTS, BisimulationResult } from './types';
+/**
+ * Particiona el LTS según bisimulación fuerte usando Paige-Tarjan.
+ * Devuelve la partición canónica donde dos estados están en el mismo bloque
+ * sii son fuertemente bisimilares.
+ */
+export declare function paigeTarjan(lts: LTS): BisimulationResult;
+//# sourceMappingURL=paige-tarjan.d.ts.map

package/dist/runtime/bisimulation/paige-tarjan.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"paige-tarjan.d.ts","sourceRoot":"","sources":["../../../src/runtime/bisimulation/paige-tarjan.ts"],"names":[],"mappings":"AAoBA,OAAO,KAAK,EAAE,GAAG,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AAyEvD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,GAAG,GAAG,kBAAkB,CA+GxD"}