@stevenvo780/st-lang 4.2.0 → 4.3.0

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/fca/context.d.ts

@@ -0,0 +1,46 @@
+import type { FormalContext } from './types';
+/**
+ * Construye un contexto formal a partir de listas de objetos, atributos y
+ * la lista bruta de incidencias.
+ *
+ * Valida:
+ *  - Los identificadores no pueden contener el separador '|'.
+ *  - No se admiten objetos o atributos duplicados.
+ *  - Cada incidencia [g, m] debe referirse a objetos/atributos declarados.
+ */
+export declare function createContext(objects: string[], attributes: string[], incidence: Array<[string, string]>): FormalContext;
+/**
+ * Indica si el objeto `g` tiene el atributo `m` en el contexto.
+ * O(1) gracias a la representación como Set de pares codificados.
+ */
+export declare function hasIncidence(ctx: FormalContext, g: string, m: string): boolean;
+/**
+ * Operador polar B → B'  (atributos → objetos).
+ * Devuelve el conjunto de objetos que poseen TODOS los atributos de `attrs`.
+ * Si `attrs` es vacío, el resultado es G (convención: ∀ trivialmente cierto).
+ */
+export declare function derivativeObjects(ctx: FormalContext, attrs: Set<string>): Set<string>;
+/**
+ * Operador polar A → A'  (objetos → atributos).
+ * Devuelve los atributos compartidos por TODOS los objetos de `objs`.
+ * Si `objs` es vacío, el resultado es M.
+ */
+export declare function derivativeAttributes(ctx: FormalContext, objs: Set<string>): Set<string>;
+/**
+ * Verifica si (extent, intent) es un concepto formal en `ctx`:
+ *   extent' = intent  y  intent' = extent.
+ *
+ * Equivale a verificar la doble clausura, pero se computa directo desde la
+ * relación de incidencia, sin acumular intermedios.
+ */
+export declare function isConcept(ctx: FormalContext, extent: Set<string>, intent: Set<string>): boolean;
+/**
+ * Clausura de Galois sobre intents:  B → B'' = (B')'.
+ * Idempotente: closeIntent(closeIntent(B)) = closeIntent(B).
+ */
+export declare function closeIntent(ctx: FormalContext, intent: Set<string>): Set<string>;
+/**
+ * Clausura sobre extents:  A → A'' = (A')'.
+ */
+export declare function closeExtent(ctx: FormalContext, extent: Set<string>): Set<string>;
+//# sourceMappingURL=context.d.ts.map

package/dist/runtime/fca/context.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"context.d.ts","sourceRoot":"","sources":["../../../src/runtime/fca/context.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAQ7C;;;;;;;;GAQG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,MAAM,EAAE,EACjB,UAAU,EAAE,MAAM,EAAE,EACpB,SAAS,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GACjC,aAAa,CAsCf;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,aAAa,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAE9E;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,aAAa,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAarF;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,aAAa,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAavF;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,GAAG,EAAE,aAAa,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,OAAO,CAI/F;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,aAAa,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAEhF;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,aAAa,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAEhF"}

package/dist/runtime/fca/context.js

@@ -0,0 +1,155 @@
+"use strict";
+// ============================================================
+// FCA — construcción del contexto y operadores polares de Galois.
+// ============================================================
+// Aquí viven las primitivas de bajo nivel: construir K = (G, M, I) y
+// computar las dos derivaciones A → A' y B → B' que sustentan toda la
+// teoría (definición de concepto, clausura, implicación).
+//
+// Notación interna: codificamos un par (g, m) ∈ I como la cadena
+// "g|m". El delimitador '|' es seguro porque obligamos que ningún
+// identificador lo contenga (createContext lo valida); de lo contrario
+// usaríamos un Map<string, Set<string>>.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createContext = createContext;
+exports.hasIncidence = hasIncidence;
+exports.derivativeObjects = derivativeObjects;
+exports.derivativeAttributes = derivativeAttributes;
+exports.isConcept = isConcept;
+exports.closeIntent = closeIntent;
+exports.closeExtent = closeExtent;
+const SEP = '|';
+function encode(obj, attr) {
+    return `${obj}${SEP}${attr}`;
+}
+/**
+ * Construye un contexto formal a partir de listas de objetos, atributos y
+ * la lista bruta de incidencias.
+ *
+ * Valida:
+ *  - Los identificadores no pueden contener el separador '|'.
+ *  - No se admiten objetos o atributos duplicados.
+ *  - Cada incidencia [g, m] debe referirse a objetos/atributos declarados.
+ */
+function createContext(objects, attributes, incidence) {
+    const objSet = new Set();
+    for (const o of objects) {
+        if (o.includes(SEP)) {
+            throw new Error(`createContext: objeto "${o}" contiene el separador reservado "${SEP}"`);
+        }
+        if (objSet.has(o)) {
+            throw new Error(`createContext: objeto duplicado "${o}"`);
+        }
+        objSet.add(o);
+    }
+    const attrSet = new Set();
+    for (const a of attributes) {
+        if (a.includes(SEP)) {
+            throw new Error(`createContext: atributo "${a}" contiene el separador reservado "${SEP}"`);
+        }
+        if (attrSet.has(a)) {
+            throw new Error(`createContext: atributo duplicado "${a}"`);
+        }
+        attrSet.add(a);
+    }
+    const inc = new Set();
+    for (const [g, m] of incidence) {
+        if (!objSet.has(g)) {
+            throw new Error(`createContext: incidencia refiere objeto desconocido "${g}"`);
+        }
+        if (!attrSet.has(m)) {
+            throw new Error(`createContext: incidencia refiere atributo desconocido "${m}"`);
+        }
+        inc.add(encode(g, m));
+    }
+    return {
+        objects: [...objects],
+        attributes: [...attributes],
+        incidence: inc,
+    };
+}
+/**
+ * Indica si el objeto `g` tiene el atributo `m` en el contexto.
+ * O(1) gracias a la representación como Set de pares codificados.
+ */
+function hasIncidence(ctx, g, m) {
+    return ctx.incidence.has(encode(g, m));
+}
+/**
+ * Operador polar B → B'  (atributos → objetos).
+ * Devuelve el conjunto de objetos que poseen TODOS los atributos de `attrs`.
+ * Si `attrs` es vacío, el resultado es G (convención: ∀ trivialmente cierto).
+ */
+function derivativeObjects(ctx, attrs) {
+    const out = new Set();
+    for (const g of ctx.objects) {
+        let ok = true;
+        for (const m of attrs) {
+            if (!hasIncidence(ctx, g, m)) {
+                ok = false;
+                break;
+            }
+        }
+        if (ok)
+            out.add(g);
+    }
+    return out;
+}
+/**
+ * Operador polar A → A'  (objetos → atributos).
+ * Devuelve los atributos compartidos por TODOS los objetos de `objs`.
+ * Si `objs` es vacío, el resultado es M.
+ */
+function derivativeAttributes(ctx, objs) {
+    const out = new Set();
+    for (const m of ctx.attributes) {
+        let ok = true;
+        for (const g of objs) {
+            if (!hasIncidence(ctx, g, m)) {
+                ok = false;
+                break;
+            }
+        }
+        if (ok)
+            out.add(m);
+    }
+    return out;
+}
+/**
+ * Verifica si (extent, intent) es un concepto formal en `ctx`:
+ *   extent' = intent  y  intent' = extent.
+ *
+ * Equivale a verificar la doble clausura, pero se computa directo desde la
+ * relación de incidencia, sin acumular intermedios.
+ */
+function isConcept(ctx, extent, intent) {
+    const intentFromExtent = derivativeAttributes(ctx, extent);
+    const extentFromIntent = derivativeObjects(ctx, intent);
+    return setsEqual(intentFromExtent, intent) && setsEqual(extentFromIntent, extent);
+}
+/**
+ * Clausura de Galois sobre intents:  B → B'' = (B')'.
+ * Idempotente: closeIntent(closeIntent(B)) = closeIntent(B).
+ */
+function closeIntent(ctx, intent) {
+    return derivativeAttributes(ctx, derivativeObjects(ctx, intent));
+}
+/**
+ * Clausura sobre extents:  A → A'' = (A')'.
+ */
+function closeExtent(ctx, extent) {
+    return derivativeObjects(ctx, derivativeAttributes(ctx, extent));
+}
+// ----------------------------------------------------------------
+// helpers
+// ----------------------------------------------------------------
+function setsEqual(a, b) {
+    if (a.size !== b.size)
+        return false;
+    for (const x of a)
+        if (!b.has(x))
+            return false;
+    return true;
+}
+//# sourceMappingURL=context.js.map

package/dist/runtime/fca/context.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"context.js","sourceRoot":"","sources":["../../../src/runtime/fca/context.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,kEAAkE;AAClE,+DAA+D;AAC/D,qEAAqE;AACrE,sEAAsE;AACtE,0DAA0D;AAC1D,EAAE;AACF,iEAAiE;AACjE,kEAAkE;AAClE,uEAAuE;AACvE,yCAAyC;AACzC,+DAA+D;;AAmB/D,sCA0CC;AAMD,oCAEC;AAOD,8CAaC;AAOD,oDAaC;AASD,8BAIC;AAMD,kCAEC;AAKD,kCAEC;AArID,MAAM,GAAG,GAAG,GAAG,CAAC;AAEhB,SAAS,MAAM,CAAC,GAAW,EAAE,IAAY;IACvC,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,EAAE,CAAC;AAC/B,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,aAAa,CAC3B,OAAiB,EACjB,UAAoB,EACpB,SAAkC;IAElC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,sCAAsC,GAAG,GAAG,CAAC,CAAC;QAC3F,CAAC;QACD,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,GAAG,CAAC,CAAC;QAC5D,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,sCAAsC,GAAG,GAAG,CAAC,CAAC;QAC7F,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,GAAG,CAAC,CAAC;QAC9D,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,GAAG,CAAC,CAAC;QACjF,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,GAAG,CAAC,CAAC;QACnF,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,OAAO;QACL,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;QACrB,UAAU,EAAE,CAAC,GAAG,UAAU,CAAC;QAC3B,SAAS,EAAE,GAAG;KACf,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAgB,YAAY,CAAC,GAAkB,EAAE,CAAS,EAAE,CAAS;IACnE,OAAO,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC;AAED;;;;GAIG;AACH,SAAgB,iBAAiB,CAAC,GAAkB,EAAE,KAAkB;IACtE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;QAC5B,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC7B,EAAE,GAAG,KAAK,CAAC;gBACX,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,EAAE;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAgB,oBAAoB,CAAC,GAAkB,EAAE,IAAiB;IACxE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;QAC/B,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC7B,EAAE,GAAG,KAAK,CAAC;gBACX,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,EAAE;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,SAAS,CAAC,GAAkB,EAAE,MAAmB,EAAE,MAAmB;IACpF,MAAM,gBAAgB,GAAG,oBAAoB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC3D,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACxD,OAAO,SAAS,CAAC,gBAAgB,EAAE,MAAM,CAAC,IAAI,SAAS,CAAC,gBAAgB,EAAE,MAAM,CAAC,CAAC;AACpF,CAAC;AAED;;;GAGG;AACH,SAAgB,WAAW,CAAC,GAAkB,EAAE,MAAmB;IACjE,OAAO,oBAAoB,CAAC,GAAG,EAAE,iBAAiB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;AACnE,CAAC;AAED;;GAEG;AACH,SAAgB,WAAW,CAAC,GAAkB,EAAE,MAAmB;IACjE,OAAO,iBAAiB,CAAC,GAAG,EAAE,oBAAoB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;AACnE,CAAC;AAED,mEAAmE;AACnE,UAAU;AACV,mEAAmE;AAEnE,SAAS,SAAS,CAAI,CAAS,EAAE,CAAS;IACxC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAC/C,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/runtime/fca/implications.d.ts

@@ -0,0 +1,10 @@
+import type { FormalContext } from './types';
+/**
+ * Devuelve `true` si en `ctx` la implicación `premise → conclusion` es
+ * válida: todo objeto que satisface todos los atributos de `premise`
+ * satisface también todos los de `conclusion`.
+ *
+ * Equivalencia formal:  premise → conclusion  ⇔  conclusion ⊆ premise''.
+ */
+export declare function impliesAll(ctx: FormalContext, premise: Set<string>, conclusion: Set<string>): boolean;
+//# sourceMappingURL=implications.d.ts.map

package/dist/runtime/fca/implications.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"implications.d.ts","sourceRoot":"","sources":["../../../src/runtime/fca/implications.ts"],"names":[],"mappings":"AAeA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAE7C;;;;;;GAMG;AACH,wBAAgB,UAAU,CACxB,GAAG,EAAE,aAAa,EAClB,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,EACpB,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,GACtB,OAAO,CAMT"}

package/dist/runtime/fca/implications.js

@@ -0,0 +1,33 @@
+"use strict";
+// ============================================================
+// FCA — implicaciones de atributos.
+// ============================================================
+// Una implicación P → C entre subconjuntos de atributos es válida en el
+// contexto K sii todo objeto que tiene todos los atributos de P tiene
+// también todos los atributos de C. Equivale a:
+//   P → C válida en K  ⇔  C ⊆ P''   (P'' = closeIntent(P))
+// que en términos de extents es: P' ⊆ C'.
+//
+// Esto es la base del cálculo Armstrong/Duquenne-Guigues para bases de
+// implicaciones. Aquí exponemos solo el test de validez puntual; la
+// extracción de la base canónica se deja a un sprint posterior.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.impliesAll = impliesAll;
+const context_1 = require("./context");
+/**
+ * Devuelve `true` si en `ctx` la implicación `premise → conclusion` es
+ * válida: todo objeto que satisface todos los atributos de `premise`
+ * satisface también todos los de `conclusion`.
+ *
+ * Equivalencia formal:  premise → conclusion  ⇔  conclusion ⊆ premise''.
+ */
+function impliesAll(ctx, premise, conclusion) {
+    const closure = (0, context_1.closeIntent)(ctx, premise);
+    for (const m of conclusion) {
+        if (!closure.has(m))
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=implications.js.map

package/dist/runtime/fca/implications.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"implications.js","sourceRoot":"","sources":["../../../src/runtime/fca/implications.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,oCAAoC;AACpC,+DAA+D;AAC/D,wEAAwE;AACxE,sEAAsE;AACtE,gDAAgD;AAChD,2DAA2D;AAC3D,0CAA0C;AAC1C,EAAE;AACF,uEAAuE;AACvE,oEAAoE;AACpE,gEAAgE;AAChE,+DAA+D;;AAY/D,gCAUC;AApBD,uCAAwC;AAGxC;;;;;;GAMG;AACH,SAAgB,UAAU,CACxB,GAAkB,EAClB,OAAoB,EACpB,UAAuB;IAEvB,MAAM,OAAO,GAAG,IAAA,qBAAW,EAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACpC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

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

@@ -0,0 +1,6 @@
+export type { FormalContext, FormalConcept, HasseLattice } from './types';
+export { createContext, derivativeObjects, derivativeAttributes, isConcept, closeIntent, closeExtent, hasIncidence, } from './context';
+export { allConcepts } from './next-closure';
+export { lattice } from './lattice';
+export { impliesAll } from './implications';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/runtime/fca/index.ts"],"names":[],"mappings":"AAsBA,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAC1E,OAAO,EACL,aAAa,EACb,iBAAiB,EACjB,oBAAoB,EACpB,SAAS,EACT,WAAW,EACX,WAAW,EACX,YAAY,GACb,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC"}

package/dist/runtime/fca/index.js

@@ -0,0 +1,39 @@
+"use strict";
+// ============================================================
+// ST Formal Concept Analysis — barrel público.
+// ============================================================
+// Marco matemático (Wille 1982, Ganter & Wille 1999) para extraer un
+// retículo de conceptos a partir de una relación binaria objeto-atributo.
+//
+// API mínima:
+//   createContext(G, M, I)        → FormalContext
+//   derivativeObjects(K, B)       → B'   (objetos)
+//   derivativeAttributes(K, A)    → A'   (atributos)
+//   isConcept(K, A, B)            → (A, B) ∈ B(K)?
+//   closeIntent(K, B)             → B''  (clausura Galois sobre atributos)
+//   allConcepts(K)                → todos los conceptos (Next Closure)
+//   lattice(concepts)             → diagrama de Hasse (aristas cobertura)
+//   impliesAll(K, P, C)           → ¿P → C válida en K?
+//
+// Uso típico:
+//   const K = createContext(objs, attrs, pairs);
+//   const concepts = allConcepts(K);
+//   const hasse = lattice(concepts);
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.impliesAll = exports.lattice = exports.allConcepts = exports.hasIncidence = exports.closeExtent = exports.closeIntent = exports.isConcept = exports.derivativeAttributes = exports.derivativeObjects = exports.createContext = void 0;
+var context_1 = require("./context");
+Object.defineProperty(exports, "createContext", { enumerable: true, get: function () { return context_1.createContext; } });
+Object.defineProperty(exports, "derivativeObjects", { enumerable: true, get: function () { return context_1.derivativeObjects; } });
+Object.defineProperty(exports, "derivativeAttributes", { enumerable: true, get: function () { return context_1.derivativeAttributes; } });
+Object.defineProperty(exports, "isConcept", { enumerable: true, get: function () { return context_1.isConcept; } });
+Object.defineProperty(exports, "closeIntent", { enumerable: true, get: function () { return context_1.closeIntent; } });
+Object.defineProperty(exports, "closeExtent", { enumerable: true, get: function () { return context_1.closeExtent; } });
+Object.defineProperty(exports, "hasIncidence", { enumerable: true, get: function () { return context_1.hasIncidence; } });
+var next_closure_1 = require("./next-closure");
+Object.defineProperty(exports, "allConcepts", { enumerable: true, get: function () { return next_closure_1.allConcepts; } });
+var lattice_1 = require("./lattice");
+Object.defineProperty(exports, "lattice", { enumerable: true, get: function () { return lattice_1.lattice; } });
+var implications_1 = require("./implications");
+Object.defineProperty(exports, "impliesAll", { enumerable: true, get: function () { return implications_1.impliesAll; } });
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/runtime/fca/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,+CAA+C;AAC/C,+DAA+D;AAC/D,qEAAqE;AACrE,0EAA0E;AAC1E,EAAE;AACF,cAAc;AACd,kDAAkD;AAClD,mDAAmD;AACnD,qDAAqD;AACrD,mDAAmD;AACnD,2EAA2E;AAC3E,uEAAuE;AACvE,0EAA0E;AAC1E,wDAAwD;AACxD,EAAE;AACF,cAAc;AACd,iDAAiD;AACjD,qCAAqC;AACrC,qCAAqC;AACrC,+DAA+D;;;AAG/D,qCAQmB;AAPjB,wGAAA,aAAa,OAAA;AACb,4GAAA,iBAAiB,OAAA;AACjB,+GAAA,oBAAoB,OAAA;AACpB,oGAAA,SAAS,OAAA;AACT,sGAAA,WAAW,OAAA;AACX,sGAAA,WAAW,OAAA;AACX,uGAAA,YAAY,OAAA;AAEd,+CAA6C;AAApC,2GAAA,WAAW,OAAA;AACpB,qCAAoC;AAA3B,kGAAA,OAAO,OAAA;AAChB,+CAA4C;AAAnC,0GAAA,UAAU,OAAA"}

package/dist/runtime/fca/lattice.d.ts

@@ -0,0 +1,10 @@
+import type { FormalConcept, HasseLattice } from './types';
+/**
+ * Computa el diagrama de Hasse del concept lattice como lista de aristas
+ * de cobertura `[child, parent]` (índices en `concepts`).
+ *
+ * La orientación es de "específico" a "general":
+ *   `[i, j]` significa `extent_i ⊊ extent_j` y la inclusión es inmediata.
+ */
+export declare function lattice(concepts: FormalConcept[]): HasseLattice;
+//# sourceMappingURL=lattice.d.ts.map

package/dist/runtime/fca/lattice.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lattice.d.ts","sourceRoot":"","sources":["../../../src/runtime/fca/lattice.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAY3D;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,QAAQ,EAAE,aAAa,EAAE,GAAG,YAAY,CAyC/D"}