@stevenvo780/st-lang 4.1.0 → 4.3.0

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"}

package/dist/runtime/bisimulation/paige-tarjan.js

@@ -0,0 +1,199 @@
+"use strict";
+// ============================================================
+// Paige-Tarjan — partition refinement para bisimulación fuerte.
+// ============================================================
+// Complejidad O(m log n) sobre LTS finitos, donde m = |→| y n = |S|.
+//
+// Idea:
+//   - Comienza con la partición coarsest compatible con el labelling.
+//   - Mantiene una cola de "splitters" (B, a): bloque B y acción a.
+//   - Para cada splitter, particiona cada bloque X en
+//        X₁ = { s ∈ X | ∃ s -a-> t, t ∈ B }
+//        X₂ = X \ X₁
+//     y si ambos son no vacíos, reemplaza X y agrega el bloque más pequeño
+//     como nuevo splitter (heurística que da el factor log n).
+//   - Termina cuando no quedan splitters útiles.
+//
+// La implementación usa un Map de aristas inversas por acción
+//   inversa[a][to] = { from : ∃ from -a-> to }
+// para que el split sea proporcional a |a-predecessors|.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.paigeTarjan = paigeTarjan;
+function canonicalLabel(labels) {
+    if (!labels || labels.size === 0)
+        return '∅';
+    return [...labels].sort().join('|');
+}
+function compile(lts) {
+    const stateSet = new Set(lts.states);
+    const actionSet = new Set();
+    const inverse = new Map();
+    for (const [from, action, to] of lts.transitions) {
+        if (!stateSet.has(from)) {
+            throw new Error(`Bisimulation: transición desde estado desconocido "${from}"`);
+        }
+        if (!stateSet.has(to)) {
+            throw new Error(`Bisimulation: transición hacia estado desconocido "${to}"`);
+        }
+        actionSet.add(action);
+        let invA = inverse.get(action);
+        if (!invA) {
+            invA = new Map();
+            inverse.set(action, invA);
+        }
+        let bucket = invA.get(to);
+        if (!bucket) {
+            bucket = new Set();
+            invA.set(to, bucket);
+        }
+        bucket.add(from);
+    }
+    const labelKey = new Map();
+    for (const s of lts.states) {
+        labelKey.set(s, canonicalLabel(lts.labelling?.[s]));
+    }
+    return {
+        states: [...lts.states],
+        actions: [...actionSet],
+        inverse,
+        labelKey,
+    };
+}
+/**
+ * Calcula los `a-predecessors` de un conjunto target:
+ *   pre_a(B) = { s | ∃ s -a-> t, t ∈ B }
+ */
+function preimage(compiled, action, target) {
+    const out = new Set();
+    const invA = compiled.inverse.get(action);
+    if (!invA)
+        return out;
+    for (const to of target) {
+        const froms = invA.get(to);
+        if (!froms)
+            continue;
+        for (const f of froms)
+            out.add(f);
+    }
+    return out;
+}
+/**
+ * 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.
+ */
+function paigeTarjan(lts) {
+    const compiled = compile(lts);
+    // Partición inicial por labelling (refinement compatible con la condición 1).
+    const byLabel = new Map();
+    for (const s of compiled.states) {
+        const k = compiled.labelKey.get(s) ?? '∅';
+        let g = byLabel.get(k);
+        if (!g) {
+            g = new Set();
+            byLabel.set(k, g);
+        }
+        g.add(s);
+    }
+    const blocks = [];
+    const blockOf = new Map();
+    for (const members of byLabel.values()) {
+        const id = blocks.length;
+        blocks.push({ id, members });
+        for (const s of members)
+            blockOf.set(s, id);
+    }
+    // Cola de splitters: pares (blockId, action). Usamos una clave canónica para
+    // evitar inserciones duplicadas en la cola.
+    const pending = [];
+    const pendingKey = new Set();
+    const enqueue = (bid, a) => {
+        const k = `${bid}|${a}`;
+        if (pendingKey.has(k))
+            return;
+        pendingKey.add(k);
+        pending.push([bid, a]);
+    };
+    // Sembrar la cola con todos los pares (bloque inicial, acción).
+    for (const b of blocks) {
+        for (const a of compiled.actions)
+            enqueue(b.id, a);
+    }
+    let iterations = 0;
+    const maxIter = compiled.states.length * compiled.actions.length * 4 + 16;
+    while (pending.length > 0) {
+        if (iterations++ > maxIter) {
+            // Cinturón de seguridad; Paige-Tarjan termina en O(m log n).
+            break;
+        }
+        const head = pending.shift();
+        if (!head)
+            break;
+        const [splitterId, action] = head;
+        pendingKey.delete(`${splitterId}|${action}`);
+        const splitter = blocks[splitterId];
+        if (!splitter)
+            continue;
+        // pre_action(splitter.members) — estados que pueden alcanzar el splitter
+        // vía la acción dada.
+        const pre = preimage(compiled, action, splitter.members);
+        if (pre.size === 0)
+            continue;
+        // Agrupar los preimage por bloque actual (para saber qué bloques tocan).
+        const touched = new Map();
+        for (const s of pre) {
+            const bid = blockOf.get(s);
+            if (bid === undefined)
+                continue;
+            let bucket = touched.get(bid);
+            if (!bucket) {
+                bucket = new Set();
+                touched.set(bid, bucket);
+            }
+            bucket.add(s);
+        }
+        for (const [bid, inPre] of touched) {
+            const block = blocks[bid];
+            if (!block)
+                continue;
+            if (inPre.size === block.members.size)
+                continue; // splitter no separa este bloque.
+            // Particionar block en (block ∩ pre, block \ pre).
+            const outside = new Set();
+            for (const s of block.members) {
+                if (!inPre.has(s))
+                    outside.add(s);
+            }
+            // Nuevo bloque para `outside`; `block` se queda con `inPre`.
+            const newId = blocks.length;
+            blocks.push({ id: newId, members: outside });
+            block.members = inPre;
+            for (const s of outside)
+                blockOf.set(s, newId);
+            // Heurística Paige-Tarjan: encolar el bloque más pequeño como splitter.
+            // El más grande "hereda" su antiguo rol en cola sin necesidad de reencolar.
+            const smaller = block.members.size <= outside.size ? block.id : newId;
+            for (const a of compiled.actions)
+                enqueue(smaller, a);
+        }
+    }
+    // Compactar: filtrar bloques no vacíos y renumerar.
+    const finalBlocks = [];
+    const partition = new Map();
+    for (const b of blocks) {
+        if (b.members.size === 0)
+            continue;
+        const idx = finalBlocks.length;
+        finalBlocks.push([...b.members]);
+        for (const s of b.members)
+            partition.set(s, idx);
+    }
+    return {
+        partition,
+        blocks: finalBlocks,
+        numBlocks: finalBlocks.length,
+        iterations,
+    };
+}
+//# sourceMappingURL=paige-tarjan.js.map

package/dist/runtime/bisimulation/paige-tarjan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"paige-tarjan.js","sourceRoot":"","sources":["../../../src/runtime/bisimulation/paige-tarjan.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gEAAgE;AAChE,+DAA+D;AAC/D,qEAAqE;AACrE,EAAE;AACF,QAAQ;AACR,sEAAsE;AACtE,oEAAoE;AACpE,sDAAsD;AACtD,4CAA4C;AAC5C,qBAAqB;AACrB,2EAA2E;AAC3E,+DAA+D;AAC/D,iDAAiD;AACjD,EAAE;AACF,8DAA8D;AAC9D,+CAA+C;AAC/C,yDAAyD;AACzD,+DAA+D;;AAgF/D,kCA+GC;AAlLD,SAAS,cAAc,CAAC,MAA+B;IACrD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC7C,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,OAAO,CAAC,GAAQ;IACvB,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACrC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoC,CAAC;IAC5D,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QACjD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,sDAAsD,IAAI,GAAG,CAAC,CAAC;QACjF,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,sDAAsD,EAAE,GAAG,CAAC,CAAC;QAC/E,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtB,IAAI,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;YACtC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC5B,CAAC;QACD,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;YAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACvB,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;QAC3B,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,OAAO;QACL,MAAM,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;QACvB,OAAO,EAAE,CAAC,GAAG,SAAS,CAAC;QACvB,OAAO;QACP,QAAQ;KACT,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,QAAQ,CAAC,QAAqB,EAAE,MAAc,EAAE,MAAwB;IAC/E,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC1C,IAAI,CAAC,IAAI;QAAE,OAAO,GAAG,CAAC;IACtB,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAOD;;;;GAIG;AACH,SAAgB,WAAW,CAAC,GAAQ;IAClC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IAE9B,8EAA8E;IAC9E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QAChC,MAAM,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;QAC1C,IAAI,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,CAAC,GAAG,IAAI,GAAG,EAAU,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,CAAC;QACD,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACX,CAAC;IAED,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,MAAM,OAAO,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACvC,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC;QACzB,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,6EAA6E;IAC7E,4CAA4C;IAC5C,MAAM,OAAO,GAA4B,EAAE,CAAC;IAC5C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,MAAM,OAAO,GAAG,CAAC,GAAW,EAAE,CAAS,EAAE,EAAE;QACzC,MAAM,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC;QACxB,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO;QAC9B,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC,CAAC;IAEF,gEAAgE;IAChE,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,OAAO;YAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACrD,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,GAAG,EAAE,CAAC;IAC1E,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,IAAI,UAAU,EAAE,GAAG,OAAO,EAAE,CAAC;YAC3B,6DAA6D;YAC7D,MAAM;QACR,CAAC;QACD,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,IAAI;YAAE,MAAM;QACjB,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;QAClC,UAAU,CAAC,MAAM,CAAC,GAAG,UAAU,IAAI,MAAM,EAAE,CAAC,CAAC;QAC7C,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;QACpC,IAAI,CAAC,QAAQ;YAAE,SAAS;QAExB,yEAAyE;QACzE,sBAAsB;QACtB,MAAM,GAAG,GAAG,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QAE7B,yEAAyE;QACzE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC/C,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,GAAG,KAAK,SAAS;gBAAE,SAAS;YAChC,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;gBAC3B,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAC3B,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QAED,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,OAAO,CAAC,IAAI;gBAAE,SAAS,CAAC,kCAAkC;YAEnF,mDAAmD;YACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;YAClC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACpC,CAAC;YAED,6DAA6D;YAC7D,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;YAC7C,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC;YACtB,KAAK,MAAM,CAAC,IAAI,OAAO;gBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAE/C,wEAAwE;YACxE,4EAA4E;YAC5E,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;YACtE,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,OAAO;gBAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAED,oDAAoD;IACpD,MAAM,WAAW,GAAe,EAAE,CAAC;IACnC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QACnC,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC;QAC/B,WAAW,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACnD,CAAC;IAED,OAAO;QACL,SAAS;QACT,MAAM,EAAE,WAAW;QACnB,SAAS,EAAE,WAAW,CAAC,MAAM;QAC7B,UAAU;KACX,CAAC;AACJ,CAAC"}

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

@@ -0,0 +1,26 @@
+/**
+ * Sistema de transiciones etiquetadas.
+ *  - `states`      lista finita de identificadores de estado.
+ *  - `transitions` triplas [from, action, to] que codifican →.
+ *  - `labelling`   opcional: estado → conjunto de proposiciones atómicas que
+ *                  se cumplen en él. Estados ausentes se tratan como ∅.
+ */
+export interface LTS {
+    states: string[];
+    transitions: Array<[string, string, string]>;
+    labelling?: Record<string, Set<string>>;
+}
+/**
+ * Resultado de un algoritmo de partition refinement.
+ *  - `partition`  estado → índice de bloque.
+ *  - `blocks`     bloques como listas de estados (índice consistente con partition).
+ *  - `numBlocks`  cardinalidad de la partición final.
+ *  - `iterations` número de iteraciones de refinamiento ejecutadas.
+ */
+export interface BisimulationResult {
+    partition: Map<string, number>;
+    blocks: string[][];
+    numBlocks: number;
+    iterations: number;
+}
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/runtime/bisimulation/types.ts"],"names":[],"mappings":"AAoBA;;;;;;GAMG;AACH,MAAM,WAAW,GAAG;IAClB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,WAAW,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC7C,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;CACzC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,kBAAkB;IACjC,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB"}

package/dist/runtime/bisimulation/types.js

@@ -0,0 +1,22 @@
+"use strict";
+// ============================================================
+// Bisimulation — tipos públicos
+// ============================================================
+// Sistema de Transiciones Etiquetadas (LTS, Labelled Transition System):
+//   M = (S, Act, →, L)
+//     S       conjunto finito de estados
+//     Act     alfabeto de acciones
+//     →       relación de transición ⊆ S × Act × S
+//     L       función de etiquetado opcional S → 2^AP (proposiciones atómicas)
+//
+// La bisimulación fuerte ~ es la mayor relación R ⊆ S × S tal que (s, t) ∈ R
+// implica:
+//   1. L(s) = L(t)                                            (mismas etiquetas)
+//   2. ∀ s -a-> s'.  ∃ t'. t -a-> t' ∧ (s', t') ∈ R           (forward simulation)
+//   3. ∀ t -a-> t'.  ∃ s'. s -a-> s' ∧ (s', t') ∈ R           (backward simulation)
+//
+// La bisimulación débil ignora τ-transiciones internas y compara cadenas
+//   s ⇒ s' ≡ s -τ*-> ·-a-> ·-τ*-> s'
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/runtime/bisimulation/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gCAAgC;AAChC,+DAA+D;AAC/D,yEAAyE;AACzE,uBAAuB;AACvB,yCAAyC;AACzC,mCAAmC;AACnC,mDAAmD;AACnD,+EAA+E;AAC/E,EAAE;AACF,6EAA6E;AAC7E,WAAW;AACX,iFAAiF;AACjF,mFAAmF;AACnF,oFAAoF;AACpF,EAAE;AACF,yEAAyE;AACzE,qCAAqC;AACrC,+DAA+D"}

package/dist/runtime/countermodel-min/index.d.ts

@@ -0,0 +1,3 @@
+export { minimizeCountermodel } from './minimize';
+export type { CountermodelMinOptions, CountermodelMinAlgorithm, CountermodelAssignment, MinimalCountermodel, } from './types';
+//# sourceMappingURL=index.d.ts.map

package/dist/runtime/countermodel-min/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/runtime/countermodel-min/index.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAC;AAClD,YAAY,EACV,sBAAsB,EACtB,wBAAwB,EACxB,sBAAsB,EACtB,mBAAmB,GACpB,MAAM,SAAS,CAAC"}

package/dist/runtime/countermodel-min/index.js

@@ -0,0 +1,9 @@
+"use strict";
+// ============================================================
+// ST Countermodel Minimization — Barrel
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.minimizeCountermodel = void 0;
+var minimize_1 = require("./minimize");
+Object.defineProperty(exports, "minimizeCountermodel", { enumerable: true, get: function () { return minimize_1.minimizeCountermodel; } });
+//# sourceMappingURL=index.js.map

package/dist/runtime/countermodel-min/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/runtime/countermodel-min/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wCAAwC;AACxC,+DAA+D;;;AAE/D,uCAAkD;AAAzC,gHAAA,oBAAoB,OAAA"}

package/dist/runtime/countermodel-min/minimize.d.ts

@@ -0,0 +1,17 @@
+import type { Formula } from '../../types';
+import type { CountermodelMinOptions, MinimalCountermodel } from './types';
+/**
+ * Minimiza un contramodelo: devuelve el subconjunto más pequeño de
+ * asignaciones que aún hace `evaluator(asg) === false` para toda
+ * completación de las variables removidas.
+ *
+ * @param _formula  AST de la fórmula (queda en la firma para
+ *                  compatibilidad y futura especialización; el motor
+ *                  trata el evaluator como caja negra).
+ * @param fullCounter Contramodelo total: asignación que falsifica F.
+ * @param evaluator Función que devuelve `true` si la fórmula es válida
+ *                  bajo la asignación total dada.
+ * @param opts      Algoritmo y maxSteps.
+ */
+export declare function minimizeCountermodel(_formula: Formula, fullCounter: Record<string, boolean>, evaluator: (asg: Record<string, boolean>) => boolean, opts?: CountermodelMinOptions): MinimalCountermodel;
+//# sourceMappingURL=minimize.d.ts.map

package/dist/runtime/countermodel-min/minimize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"minimize.d.ts","sourceRoot":"","sources":["../../../src/runtime/countermodel-min/minimize.ts"],"names":[],"mappings":"AAgCA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,KAAK,EACV,sBAAsB,EACtB,mBAAmB,EAEpB,MAAM,SAAS,CAAC;AAWjB;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,OAAO,EACjB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACpC,SAAS,EAAE,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,OAAO,EACpD,IAAI,GAAE,sBAA2B,GAChC,mBAAmB,CAwDrB"}

package/dist/runtime/countermodel-min/minimize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"minimize.js","sourceRoot":"","sources":["../../../src/runtime/countermodel-min/minimize.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wCAAwC;AACxC,+DAA+D;AAC/D,EAAE;AACF,kEAAkE;AAClE,oEAAoE;AACpE,qCAAqC;AACrC,EAAE;AACF,gCAAgC;AAChC,oEAAoE;AACpE,qEAAqE;AACrE,uCAAuC;AACvC,EAAE;AACF,gBAAgB;AAChB,mEAAmE;AACnE,4DAA4D;AAC5D,qEAAqE;AACrE,kEAAkE;AAClE,qEAAqE;AACrE,wDAAwD;AACxD,EAAE;AACF,cAAc;AACd,qEAAqE;AACrE,6DAA6D;AAC7D,oEAAoE;AACpE,sEAAsE;AACtE,gEAAgE;AAChE,EAAE;AACF,uEAAuE;AACvE,wBAAwB;AACxB,+DAA+D;;AA+B/D,oDA6DC;AAnFD,MAAM,iBAAiB,GAAG,OAAO,CAAC;AAClC;;;;;GAKG;AACH,MAAM,cAAc,GAAG,EAAE,CAAC;AAE1B;;;;;;;;;;;;GAYG;AACH,SAAgB,oBAAoB,CAClC,QAAiB,EACjB,WAAoC,EACpC,SAAoD,EACpD,OAA+B,EAAE;IAEjC,MAAM,SAAS,GAA6B,IAAI,CAAC,SAAS,IAAI,aAAa,CAAC;IAC5E,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,iBAAiB,CAAC;IAEpD,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,CAAC;IAChD,MAAM,KAAK,GAAmB;QAC5B,WAAW;QACX,OAAO;QACP,SAAS;QACT,QAAQ;QACR,UAAU,EAAE,CAAC;QACb,KAAK,EAAE,IAAI,GAAG,EAAE;KACjB,CAAC;IAEF,iEAAiE;IACjE,iDAAiD;IACjD,KAAK,CAAC,UAAU,EAAE,CAAC;IACnB,IAAI,SAAS,CAAC,EAAE,GAAG,WAAW,EAAE,CAAC,EAAE,CAAC;QAClC,OAAO;YACL,WAAW,EAAE,aAAa,CAAC,WAAW,EAAE,OAAO,CAAC;YAChD,IAAI,EAAE,OAAO,CAAC,MAAM;YACpB,OAAO,EAAE,EAAE;YACX,UAAU,EAAE,KAAK,CAAC,UAAU;SAC7B,CAAC;IACJ,CAAC;IAED,IAAI,IAAc,CAAC;IACnB,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,eAAe;YAClB,IAAI,GAAG,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC1C,MAAM;QACR,KAAK,eAAe;YAClB,IAAI,GAAG,oBAAoB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC5C,MAAM;QACR,KAAK,aAAa;YAChB,IAAI,GAAG,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC1C,MAAM;QACR,sBAAsB;QACtB;YACE,MAAM,IAAI,KAAK,CAAC,0BAA0B,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACnE,CAAC;IAED,iEAAiE;IACjE,IAAI,SAAS,KAAK,eAAe,EAAE,CAAC;QAClC,IAAI,GAAG,kBAAkB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACzC,CAAC;IAED,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAEhE,OAAO;QACL,WAAW,EAAE,aAAa,CAAC,WAAW,EAAE,IAAI,CAAC;QAC7C,IAAI,EAAE,IAAI,CAAC,MAAM;QACjB,OAAO;QACP,UAAU,EAAE,KAAK,CAAC,UAAU;KAC7B,CAAC;AACJ,CAAC;AAeD;;;;GAIG;AACH,SAAS,YAAY,CAAC,KAAqB,EAAE,IAAc;IACzD,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;QAAE,OAAO,KAAK,CAAC;IAErD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;IACvC,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IAExC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;IACjC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1D,MAAM,MAAM,GACV,OAAO,CAAC,MAAM,IAAI,cAAc;QAC9B,CAAC,CAAC,eAAe,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC;QAC7C,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;IAEjD,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC7B,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CAAC,KAAqB,EAAE,IAAc,EAAE,OAAiB;IAC/E,MAAM,KAAK,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC;IAClC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;QACxC,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC;QACrD,MAAM,GAAG,GAA4B,EAAE,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC5C,CAAC;QACD,KAAK,CAAC,UAAU,EAAE,CAAC;QACnB,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,KAAqB,EAAE,IAAc,EAAE,OAAiB;IAC9E,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC;QACrD,MAAM,GAAG,GAA4B,EAAE,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC;QACrD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC/D,CAAC;QACD,KAAK,CAAC,UAAU,EAAE,CAAC;QACnB,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;IACzC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gEAAgE;AAEhE;;;;;;GAMG;AACH,SAAS,kBAAkB,CAAC,KAAqB,EAAE,IAAc;IAC/D,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;IAC/B,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,IAAI,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QACpD,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;YAC7B,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;gBAAE,MAAM;YAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9C,IAAI,YAAY,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;gBACnC,IAAI,GAAG,SAAS,CAAC;gBACjB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAAC,KAAqB,EAAE,IAAc;IACjE,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;IAC/B,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAElC,MAAM,SAAS,GAAG,CAAC,OAAiB,EAAY,EAAE;QAChD,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;YAAE,OAAO,OAAO,CAAC;QAE9E,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAEjC,IAAI,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;QACtD,IAAI,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;QAExD,MAAM,WAAW,GAAG,kBAAkB,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC3D,MAAM,YAAY,GAAG,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;QACnE,OAAO,CAAC,GAAG,WAAW,EAAE,GAAG,YAAY,CAAC,CAAC;IAC3C,CAAC,CAAC;IAEF,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IACvB,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAqB,EAAE,MAAgB,EAAE,KAAe;IAClF,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;QAAE,OAAO,MAAM,CAAC;IAE5E,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAEhC,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;QAC7C,OAAO,kBAAkB,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAChD,CAAC;IACD,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;QAC9C,OAAO,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACjD,CAAC;IACD,MAAM,WAAW,GAAG,kBAAkB,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;IAC1E,MAAM,YAAY,GAAG,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,WAAW,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;IAClF,OAAO,CAAC,GAAG,WAAW,EAAE,GAAG,YAAY,CAAC,CAAC;AAC3C,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,kBAAkB,CAAC,KAAqB,EAAE,IAAc;IAC/D,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,kBAAkB;QAClB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;gBAAE,MAAM;YAC9C,IAAI,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC/B,CAAC,GAAG,KAAK,CAAC;gBACV,CAAC,GAAG,CAAC,CAAC;gBACN,OAAO,GAAG,IAAI,CAAC;gBACf,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,sBAAsB;YACtB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;oBAAE,MAAM;gBAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;gBAChC,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;oBAAE,SAAS;gBACtC,IAAI,YAAY,CAAC,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC;oBACpC,CAAC,GAAG,UAAU,CAAC;oBACf,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;oBACvB,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM;gBAAE,MAAM;YACzB,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC;AAED,gEAAgE;AAEhE,0DAA0D;AAC1D,SAAS,SAAS,CAAC,GAAa,EAAE,CAAS;IACzC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QAC1C,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,4EAA4E;AAC5E,SAAS,aAAa,CACpB,WAAoC,EACpC,IAAc;IAEd,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;QACpC,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAE,CAAC;IAC3B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/runtime/countermodel-min/types.d.ts

@@ -0,0 +1,40 @@
+/**
+ * Algoritmo de minimización a usar.
+ *
+ * - `one-at-a-time`: O(n) pruebas. Por cada variable intenta removerla;
+ *   si la fórmula sigue siendo falsada (para ambas completaciones de la
+ *   variable removida), la elimina permanentemente.
+ * - `binary-search`: O(n log n). Divide el conjunto de assignments en
+ *   mitades y trata de descartar la mitad completa de una vez.
+ * - `delta-debug`: O(n log n) en el peor caso, mucho más rápido en la
+ *   práctica. Granularidad creciente al estilo Zeller 1999. Empieza
+ *   removiendo bloques grandes y se reduce a granularidad 1.
+ */
+export type CountermodelMinAlgorithm = 'delta-debug' | 'binary-search' | 'one-at-a-time';
+export interface CountermodelMinOptions {
+    /** Algoritmo a utilizar. Default: `delta-debug`. */
+    algorithm?: CountermodelMinAlgorithm;
+    /** Tope superior de iteraciones (llamadas a evaluator). Default: 10_000. */
+    maxSteps?: number;
+}
+/**
+ * Asignación final: para cada variable que queda en el contramodelo
+ * mínimo, guardamos su valor.
+ *
+ * Para perfiles clásicos los valores son `boolean`. Se permite también
+ * `'T'`, `'F'`, `'both'`, `'neither'` para perfiles paraconsistentes
+ * (Belnap) — la API queda abierta a futuro aunque el algoritmo actual
+ * sólo opera sobre `boolean`.
+ */
+export type CountermodelAssignment = Record<string, boolean | 'T' | 'F' | 'both' | 'neither'>;
+export interface MinimalCountermodel {
+    /** Asignación mínima (solo variables relevantes). */
+    assignments: CountermodelAssignment;
+    /** Cantidad de variables en `assignments`. */
+    size: number;
+    /** Variables que el algoritmo eliminó (ordenadas alfabéticamente). */
+    removed: string[];
+    /** Iteraciones (llamadas a `evaluator`) consumidas. */
+    iterations: number;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/runtime/countermodel-min/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/runtime/countermodel-min/types.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,wBAAwB,GAAG,aAAa,GAAG,eAAe,GAAG,eAAe,CAAC;AAEzF,MAAM,WAAW,sBAAsB;IACrC,oDAAoD;IACpD,SAAS,CAAC,EAAE,wBAAwB,CAAC;IACrC,4EAA4E;IAC5E,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;;;;;;;GAQG;AACH,MAAM,MAAM,sBAAsB,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,MAAM,GAAG,SAAS,CAAC,CAAC;AAE9F,MAAM,WAAW,mBAAmB;IAClC,qDAAqD;IACrD,WAAW,EAAE,sBAAsB,CAAC;IACpC,8CAA8C;IAC9C,IAAI,EAAE,MAAM,CAAC;IACb,sEAAsE;IACtE,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,uDAAuD;IACvD,UAAU,EAAE,MAAM,CAAC;CACpB"}

package/dist/runtime/countermodel-min/types.js

@@ -0,0 +1,6 @@
+"use strict";
+// ============================================================
+// ST Countermodel Minimization — Tipos públicos
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/runtime/countermodel-min/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/runtime/countermodel-min/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gDAAgD;AAChD,+DAA+D"}