@stevenvo780/st-lang 4.8.0 → 4.10.0

package/dist/reasoning/automata/regex.js

@@ -0,0 +1,259 @@
+"use strict";
+// ============================================================
+// ST Automata — Regex parsing + Thompson construction
+// ============================================================
+//
+// Gramática soportada (precedencia: postfix > concat > '|'):
+//
+//   expr   := term ( '|' term )*
+//   term   := factor*                (concatenación implícita)
+//   factor := atom ( '*' | '+' | '?' )*
+//   atom   := char | '(' expr ')' | '∅' (vacío) | 'ε'
+//
+// Caracteres reservados: ( ) | * + ?  → escapar con '\'.
+// '∅' y 'ε' son atómicos opcionales (no son obligatorios para parsear).
+//
+// `regexToNfa` construye un NFA por la construcción de Thompson:
+// para cada operador un fragmento con un único initial y un único accept.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.parseRegex = parseRegex;
+exports.regexToNfa = regexToNfa;
+exports.regexMatches = regexMatches;
+const types_1 = require("./types");
+const nfa_1 = require("./nfa");
+function peek(c) {
+    return c.i < c.s.length ? c.s[c.i] : undefined;
+}
+function consume(c) {
+    const ch = peek(c);
+    if (ch !== undefined)
+        c.i++;
+    return ch;
+}
+function expect(c, ch) {
+    const got = consume(c);
+    if (got !== ch)
+        throw new Error(`parseRegex: esperaba "${ch}" en pos ${c.i - 1}, vi "${got ?? 'EOF'}"`);
+}
+const POSTFIX = new Set(['*', '+', '?']);
+const SPECIAL = new Set(['(', ')', '|', '*', '+', '?', '\\']);
+function parseExpr(c) {
+    let left = parseTerm(c);
+    while (peek(c) === '|') {
+        consume(c);
+        const right = parseTerm(c);
+        left = { kind: 'union', left, right };
+    }
+    return left;
+}
+function parseTerm(c) {
+    // term puede ser vacío → ε.
+    const atoms = [];
+    while (true) {
+        const ch = peek(c);
+        if (ch === undefined || ch === '|' || ch === ')')
+            break;
+        atoms.push(parseFactor(c));
+    }
+    if (atoms.length === 0)
+        return { kind: 'epsilon' };
+    return atoms.reduce((acc, r) => ({ kind: 'concat', left: acc, right: r }));
+}
+function parseFactor(c) {
+    let atom = parseAtom(c);
+    while (true) {
+        const ch = peek(c);
+        if (ch === undefined || !POSTFIX.has(ch))
+            break;
+        consume(c);
+        if (ch === '*')
+            atom = { kind: 'star', arg: atom };
+        else if (ch === '+')
+            atom = { kind: 'plus', arg: atom };
+        else if (ch === '?')
+            atom = { kind: 'optional', arg: atom };
+    }
+    return atom;
+}
+function parseAtom(c) {
+    const ch = peek(c);
+    if (ch === undefined)
+        throw new Error('parseRegex: EOF inesperado en atom');
+    if (ch === '(') {
+        consume(c);
+        const inner = parseExpr(c);
+        expect(c, ')');
+        return inner;
+    }
+    if (ch === '\\') {
+        consume(c);
+        const esc = consume(c);
+        if (esc === undefined)
+            throw new Error('parseRegex: escape colgante');
+        return { kind: 'char', c: esc };
+    }
+    if (ch === '∅') {
+        consume(c);
+        return { kind: 'empty' };
+    }
+    if (ch === 'ε') {
+        consume(c);
+        return { kind: 'epsilon' };
+    }
+    if (SPECIAL.has(ch)) {
+        throw new Error(`parseRegex: caracter "${ch}" reservado en pos ${c.i}`);
+    }
+    consume(c);
+    return { kind: 'char', c: ch };
+}
+function parseRegex(s) {
+    const c = { s, i: 0 };
+    const r = parseExpr(c);
+    if (c.i !== s.length) {
+        throw new Error(`parseRegex: tokens restantes en pos ${c.i}: "${s.slice(c.i)}"`);
+    }
+    return r;
+}
+function emptyFragment(initial, accept) {
+    return { initial, accept, edges: new Map(), alphabet: new Set() };
+}
+function addEdge(frag, from, sym, to) {
+    let row = frag.edges.get(from);
+    if (!row) {
+        row = new Map();
+        frag.edges.set(from, row);
+    }
+    let set = row.get(sym);
+    if (!set) {
+        set = new Set();
+        row.set(sym, set);
+    }
+    set.add(to);
+    if (sym !== types_1.EPSILON)
+        frag.alphabet.add(sym);
+}
+function mergeEdges(into, other) {
+    for (const [from, row] of other.edges) {
+        for (const [sym, set] of row) {
+            for (const to of set)
+                addEdge(into, from, sym, to);
+        }
+    }
+    for (const a of other.alphabet)
+        into.alphabet.add(a);
+}
+function buildFragment(r, fresh) {
+    if (r.kind === 'epsilon') {
+        const init = fresh();
+        const acc = fresh();
+        const frag = emptyFragment(init, acc);
+        addEdge(frag, init, types_1.EPSILON, acc);
+        return frag;
+    }
+    if (r.kind === 'empty') {
+        // Lenguaje vacío: dos estados sin conexión. No hay camino al accept.
+        const init = fresh();
+        const acc = fresh();
+        return emptyFragment(init, acc);
+    }
+    if (r.kind === 'char') {
+        const init = fresh();
+        const acc = fresh();
+        const frag = emptyFragment(init, acc);
+        addEdge(frag, init, r.c, acc);
+        return frag;
+    }
+    if (r.kind === 'concat') {
+        const A = buildFragment(r.left, fresh);
+        const B = buildFragment(r.right, fresh);
+        const frag = emptyFragment(A.initial, B.accept);
+        mergeEdges(frag, A);
+        mergeEdges(frag, B);
+        addEdge(frag, A.accept, types_1.EPSILON, B.initial);
+        return frag;
+    }
+    if (r.kind === 'union') {
+        const A = buildFragment(r.left, fresh);
+        const B = buildFragment(r.right, fresh);
+        const init = fresh();
+        const acc = fresh();
+        const frag = emptyFragment(init, acc);
+        mergeEdges(frag, A);
+        mergeEdges(frag, B);
+        addEdge(frag, init, types_1.EPSILON, A.initial);
+        addEdge(frag, init, types_1.EPSILON, B.initial);
+        addEdge(frag, A.accept, types_1.EPSILON, acc);
+        addEdge(frag, B.accept, types_1.EPSILON, acc);
+        return frag;
+    }
+    if (r.kind === 'star') {
+        const A = buildFragment(r.arg, fresh);
+        const init = fresh();
+        const acc = fresh();
+        const frag = emptyFragment(init, acc);
+        mergeEdges(frag, A);
+        addEdge(frag, init, types_1.EPSILON, A.initial);
+        addEdge(frag, init, types_1.EPSILON, acc);
+        addEdge(frag, A.accept, types_1.EPSILON, A.initial);
+        addEdge(frag, A.accept, types_1.EPSILON, acc);
+        return frag;
+    }
+    if (r.kind === 'plus') {
+        // a+ = a · a*
+        return buildFragment({ kind: 'concat', left: r.arg, right: { kind: 'star', arg: r.arg } }, fresh);
+    }
+    if (r.kind === 'optional') {
+        // a? = a | ε
+        return buildFragment({ kind: 'union', left: r.arg, right: { kind: 'epsilon' } }, fresh);
+    }
+    // Exhaustivo.
+    const _exhaustive = r;
+    return _exhaustive;
+}
+function regexToNfa(r) {
+    let counter = 0;
+    const fresh = () => counter++;
+    const frag = buildFragment(r, fresh);
+    // Convertir entero → string para encajar con NFA.
+    const stateName = (n) => `s${n}`;
+    const states = new Set();
+    const transitions = new Map();
+    // Asegurar que todos los estados conocidos estén poblados, incluso los
+    // que sólo aparecen como destino.
+    const seen = new Set();
+    for (const [from, row] of frag.edges) {
+        seen.add(from);
+        for (const set of row.values())
+            for (const to of set)
+                seen.add(to);
+    }
+    seen.add(frag.initial);
+    seen.add(frag.accept);
+    for (const n of seen)
+        states.add(stateName(n));
+    for (const [from, row] of frag.edges) {
+        const newRow = new Map();
+        for (const [sym, set] of row) {
+            const newSet = new Set();
+            for (const to of set)
+                newSet.add(stateName(to));
+            newRow.set(sym, newSet);
+        }
+        transitions.set(stateName(from), newRow);
+    }
+    return {
+        states,
+        alphabet: frag.alphabet,
+        transitions,
+        initial: stateName(frag.initial),
+        accept: new Set([stateName(frag.accept)]),
+        epsilon: types_1.EPSILON,
+    };
+}
+/** Atajo: ¿la expresión regular `r` matchea exactamente `s`? */
+function regexMatches(r, s) {
+    const nfa = regexToNfa(r);
+    return (0, nfa_1.nfaAccepts)(nfa, s);
+}
+//# sourceMappingURL=regex.js.map

package/dist/reasoning/automata/regex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"regex.js","sourceRoot":"","sources":["../../../src/reasoning/automata/regex.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sDAAsD;AACtD,+DAA+D;AAC/D,EAAE;AACF,6DAA6D;AAC7D,EAAE;AACF,iCAAiC;AACjC,+DAA+D;AAC/D,wCAAwC;AACxC,sDAAsD;AACtD,EAAE;AACF,yDAAyD;AACzD,wEAAwE;AACxE,EAAE;AACF,iEAAiE;AACjE,0EAA0E;AAC1E,+DAA+D;;AAiG/D,gCAOC;AAoHD,gCAwCC;AAGD,oCAGC;AAvQD,mCAAkC;AAClC,+BAAmC;AASnC,SAAS,IAAI,CAAC,CAAS;IACrB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACjD,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnB,IAAI,EAAE,KAAK,SAAS;QAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5B,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,SAAS,MAAM,CAAC,CAAS,EAAE,EAAU;IACnC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,GAAG,KAAK,EAAE;QACZ,MAAM,IAAI,KAAK,CAAC,yBAAyB,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,GAAG,IAAI,KAAK,GAAG,CAAC,CAAC;AAC5F,CAAC;AAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AACzC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;AAE9D,SAAS,SAAS,CAAC,CAAS;IAC1B,IAAI,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACxB,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;QACvB,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACxC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAAC,CAAS;IAC1B,4BAA4B;IAC5B,MAAM,KAAK,GAAY,EAAE,CAAC;IAC1B,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG;YAAE,MAAM;QACxD,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IACnD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC7E,CAAC;AAED,SAAS,WAAW,CAAC,CAAS;IAC5B,IAAI,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACxB,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,MAAM;QAChD,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,IAAI,EAAE,KAAK,GAAG;YAAE,IAAI,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;aAC9C,IAAI,EAAE,KAAK,GAAG;YAAE,IAAI,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;aACnD,IAAI,EAAE,KAAK,GAAG;YAAE,IAAI,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;IAC9D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAAC,CAAS;IAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnB,IAAI,EAAE,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAC5E,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;QACf,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACf,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;QAChB,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,GAAG,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;QACtE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;IAClC,CAAC;IACD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;QACf,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IAC3B,CAAC;IACD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;QACf,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IAC7B,CAAC;IACD,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,yBAAyB,EAAE,sBAAsB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,CAAC,CAAC,CAAC,CAAC;IACX,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;AACjC,CAAC;AAED,SAAgB,UAAU,CAAC,CAAS;IAClC,MAAM,CAAC,GAAW,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC9B,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QACrB,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACnF,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAgBD,SAAS,aAAa,CAAC,OAAe,EAAE,MAAc;IACpD,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;AACpE,CAAC;AAED,SAAS,OAAO,CAAC,IAAc,EAAE,IAAY,EAAE,GAAW,EAAE,EAAU;IACpE,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC5B,CAAC;IACD,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACvB,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;QAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACpB,CAAC;IACD,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACZ,IAAI,GAAG,KAAK,eAAO;QAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,UAAU,CAAC,IAAc,EAAE,KAAe;IACjD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACtC,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC;YAC7B,KAAK,MAAM,EAAE,IAAI,GAAG;gBAAE,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ;QAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,SAAS,aAAa,CAAC,CAAQ,EAAE,KAAmB;IAClD,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,KAAK,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACtC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,eAAO,EAAE,GAAG,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACvB,qEAAqE;QACrE,MAAM,IAAI,GAAG,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,KAAK,EAAE,CAAC;QACpB,OAAO,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,KAAK,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACtC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QAChD,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpB,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpB,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,eAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QAC5C,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,KAAK,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACtC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpB,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpB,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,eAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QACxC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,eAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QACxC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,eAAO,EAAE,GAAG,CAAC,CAAC;QACtC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,eAAO,EAAE,GAAG,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,KAAK,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACtC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpB,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,eAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QACxC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,eAAO,EAAE,GAAG,CAAC,CAAC;QAClC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,eAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QAC5C,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,eAAO,EAAE,GAAG,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACtB,cAAc;QACd,OAAO,aAAa,CAClB,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,EACpE,KAAK,CACN,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC1B,aAAa;QACb,OAAO,aAAa,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;IAC1F,CAAC;IACD,cAAc;IACd,MAAM,WAAW,GAAU,CAAC,CAAC;IAC7B,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,SAAgB,UAAU,CAAC,CAAQ;IACjC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,KAAK,GAAG,GAAW,EAAE,CAAC,OAAO,EAAE,CAAC;IACtC,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAErC,kDAAkD;IAClD,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;IACzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoC,CAAC;IAEhE,uEAAuE;IACvE,kCAAkC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACrC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACf,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,EAAE;YAAE,KAAK,MAAM,EAAE,IAAI,GAAG;gBAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACrE,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACvB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEtB,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/C,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC9C,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;YACjC,KAAK,MAAM,EAAE,IAAI,GAAG;gBAAE,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC1B,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;IAC3C,CAAC;IAED,OAAO;QACL,MAAM;QACN,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,WAAW;QACX,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC;QAChC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACzC,OAAO,EAAE,eAAO;KACjB,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,SAAgB,YAAY,CAAC,CAAQ,EAAE,CAAS;IAC9C,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC1B,OAAO,IAAA,gBAAU,EAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAC5B,CAAC"}

package/dist/reasoning/automata/types.d.ts

@@ -0,0 +1,69 @@
+export declare const EPSILON: "\u03B5";
+export type Symbol = string;
+export interface DFA {
+    readonly states: Set<string>;
+    readonly alphabet: Set<Symbol>;
+    /** state → symbol → state. La función puede ser parcial: si falta una
+     *  arista para (state, symbol), la palabra es rechazada. */
+    readonly transitions: Map<string, Map<Symbol, string>>;
+    readonly initial: string;
+    readonly accept: Set<string>;
+}
+export interface NFA {
+    readonly states: Set<string>;
+    readonly alphabet: Set<Symbol>;
+    /** state → symbol (puede ser EPSILON) → P(states). */
+    readonly transitions: Map<string, Map<Symbol, Set<string>>>;
+    readonly initial: string;
+    readonly accept: Set<string>;
+    /** Símbolo usado como ε; default `EPSILON` ('ε'). */
+    readonly epsilon?: Symbol;
+}
+export type Regex = {
+    kind: 'empty';
+} | {
+    kind: 'epsilon';
+} | {
+    kind: 'char';
+    c: Symbol;
+} | {
+    kind: 'concat';
+    left: Regex;
+    right: Regex;
+} | {
+    kind: 'union';
+    left: Regex;
+    right: Regex;
+} | {
+    kind: 'star';
+    arg: Regex;
+} | {
+    kind: 'plus';
+    arg: Regex;
+} | {
+    kind: 'optional';
+    arg: Regex;
+};
+export interface PDATransition {
+    /** Estado origen. */
+    readonly state: string;
+    /** Símbolo de entrada a consumir; EPSILON = sin consumir. */
+    readonly read: Symbol;
+    /** Tope de pila a desapilar; EPSILON = sin pop. */
+    readonly popTop: Symbol;
+    /** Estado destino. */
+    readonly nextState: string;
+    /** Símbolos a apilar (el último queda en la cima). [] = no push. */
+    readonly pushTop: ReadonlyArray<Symbol>;
+}
+export interface PDA {
+    readonly states: Set<string>;
+    readonly alphabet: Set<Symbol>;
+    readonly stackAlphabet: Set<Symbol>;
+    readonly transitions: ReadonlyArray<PDATransition>;
+    readonly initial: string;
+    readonly initialStack: Symbol;
+    /** Aceptación por estado final. */
+    readonly accept: Set<string>;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/reasoning/automata/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/reasoning/automata/types.ts"],"names":[],"mappings":"AAyBA,eAAO,MAAM,OAAO,EAAG,QAAY,CAAC;AAEpC,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC;AAI5B,MAAM,WAAW,GAAG;IAClB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/B;gEAC4D;IAC5D,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAC9B;AAID,MAAM,WAAW,GAAG;IAClB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/B,sDAAsD;IACtD,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC5D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,qDAAqD;IACrD,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;CAC3B;AAID,MAAM,MAAM,KAAK,GACb;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE,GACjB;IAAE,IAAI,EAAE,SAAS,CAAA;CAAE,GACnB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,GAC3B;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,KAAK,CAAA;CAAE,GAC7C;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,KAAK,CAAA;CAAE,GAC5C;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,KAAK,CAAA;CAAE,GAC5B;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,KAAK,CAAA;CAAE,GAC5B;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,GAAG,EAAE,KAAK,CAAA;CAAE,CAAC;AAIrC,MAAM,WAAW,aAAa;IAC5B,qBAAqB;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,6DAA6D;IAC7D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,mDAAmD;IACnD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,sBAAsB;IACtB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,oEAAoE;IACpE,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;CACzC;AAED,MAAM,WAAW,GAAG;IAClB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/B,QAAQ,CAAC,aAAa,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACpC,QAAQ,CAAC,WAAW,EAAE,aAAa,CAAC,aAAa,CAAC,CAAC;IACnD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,mCAAmC;IACnC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAC9B"}

package/dist/reasoning/automata/types.js

@@ -0,0 +1,29 @@
+"use strict";
+// ============================================================
+// ST Automata — Tipos
+// ============================================================
+//
+// Modelado clásico de autómatas finitos y de pila:
+//
+//   DFA (Deterministic Finite Automaton)
+//     · Transición total: state × symbol → state.
+//     · Acepta una palabra sii el camino termina en estado final.
+//
+//   NFA (Nondeterministic Finite Automaton, con ε-transiciones)
+//     · Transición: state × (symbol ∪ {ε}) → P(states).
+//     · Acepta sii existe un camino que termina en final.
+//
+//   PDA (Pushdown Automaton) — variante "by final state"
+//     · Transición: (state, read, popTop) → (nextState, pushTop[]).
+//     · `read` o `popTop` pueden ser ε (sin consumir / sin tope).
+//     · pushTop se apila en orden inverso (último → top).
+//
+// Notas:
+//   • Los símbolos son strings de longitud 1 (chars). El alfabeto
+//     se mantiene explícito porque define complement(M).
+//   • La constante EPSILON ('ε') vive aquí para reutilizarse.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EPSILON = void 0;
+exports.EPSILON = 'ε';
+//# sourceMappingURL=types.js.map

package/dist/reasoning/automata/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/reasoning/automata/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sBAAsB;AACtB,+DAA+D;AAC/D,EAAE;AACF,mDAAmD;AACnD,EAAE;AACF,yCAAyC;AACzC,kDAAkD;AAClD,kEAAkE;AAClE,EAAE;AACF,gEAAgE;AAChE,wDAAwD;AACxD,0DAA0D;AAC1D,EAAE;AACF,yDAAyD;AACzD,oEAAoE;AACpE,kEAAkE;AAClE,0DAA0D;AAC1D,EAAE;AACF,SAAS;AACT,kEAAkE;AAClE,yDAAyD;AACzD,8DAA8D;AAC9D,+DAA+D;;;AAElD,QAAA,OAAO,GAAG,GAAY,CAAC"}

package/dist/reasoning/ban-logic/analyze.d.ts

@@ -0,0 +1,31 @@
+import type { BANFormula, Protocol, ProtocolAnalysis } from './types';
+export interface SaturateOptions {
+    /** Máximo de iteraciones del punto fijo. Default: 200. */
+    maxIterations?: number;
+    /** Máximo de fórmulas nuevas a derivar. Default: 1024. */
+    maxDerivations?: number;
+}
+/**
+ * Aplica las reglas BAN al estado hasta punto fijo. Devuelve el estado
+ * saturado y la lista de derivaciones nuevas (no incluye las iniciales).
+ */
+export declare function saturate(initial: ReadonlyArray<BANFormula>, opts?: SaturateOptions): {
+    state: BANFormula[];
+    trace: BANFormula[];
+};
+/**
+ * Idealización mínima: cada step `from → to: msg` produce la
+ * fórmula `to ◁ msg`. Asumimos que el receptor literalmente ve el
+ * mensaje que se le envía.
+ *
+ * (BAN tradicional pide idealización manual para descartar texto
+ * inseguro como nombres en claro; aquí preservamos todos los
+ * subtérminos, que es la lectura conservadora.)
+ */
+export declare function idealize(p: Protocol): BANFormula[];
+/**
+ * Analiza un protocolo: parte de las assumptions + idealización,
+ * satura, y verifica goals.
+ */
+export declare function analyzeProtocol(p: Protocol, opts?: SaturateOptions): ProtocolAnalysis;
+//# sourceMappingURL=analyze.d.ts.map

package/dist/reasoning/ban-logic/analyze.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"analyze.d.ts","sourceRoot":"","sources":["../../../src/reasoning/ban-logic/analyze.ts"],"names":[],"mappings":"AA0BA,OAAO,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAEtE,MAAM,WAAW,eAAe;IAC9B,0DAA0D;IAC1D,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,0DAA0D;IAC1D,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAwBD;;;GAGG;AACH,wBAAgB,QAAQ,CACtB,OAAO,EAAE,aAAa,CAAC,UAAU,CAAC,EAClC,IAAI,CAAC,EAAE,eAAe,GACrB;IAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IAAC,KAAK,EAAE,UAAU,EAAE,CAAA;CAAE,CA4C9C;AAED;;;;;;;;GAQG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,QAAQ,GAAG,UAAU,EAAE,CAElD;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,eAAe,GAAG,gBAAgB,CAYrF"}

package/dist/reasoning/ban-logic/analyze.js

@@ -0,0 +1,113 @@
+"use strict";
+// ============================================================
+// BAN Logic — Saturación de estado + análisis de protocolos
+// ============================================================
+//
+// `saturate(state)` aplica las reglas R1-R10 en forward-chaining
+// hasta punto fijo (o cota de iteraciones). Devuelve la lista de
+// fórmulas inferidas en orden de derivación (trace).
+//
+// `analyzeProtocol(p)` toma un Protocol con assumptions, steps y goals;
+// idealiza los mensajes (cada step produce `P ◁ msg` para el receptor),
+// satura, y reporta cuáles goals quedaron satisfechos.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.saturate = saturate;
+exports.idealize = idealize;
+exports.analyzeProtocol = analyzeProtocol;
+const rules_1 = require("./rules");
+const terms_1 = require("./terms");
+const STATE_RULES = [
+    { name: 'message-meaning-shared', apply: rules_1.applyMessageMeaningShared },
+    { name: 'message-meaning-public', apply: rules_1.applyMessageMeaningPublic },
+    { name: 'message-meaning-secret', apply: rules_1.applyMessageMeaningSecret },
+    { name: 'nonce-verification', apply: rules_1.applyNonceVerification },
+    { name: 'jurisdiction', apply: rules_1.applyJurisdiction },
+    { name: 'seeing-encrypted', apply: rules_1.applySeeingEncrypted },
+    { name: 'sees-compound', apply: rules_1.applySeesCompound },
+    { name: 'freshness-propagation', apply: rules_1.applyFreshnessPropagation },
+];
+const FOCUS_ONLY_RULES = [
+    { name: 'belief-conj-left', apply: rules_1.applyBeliefConjunction },
+    { name: 'belief-conj-right', apply: rules_1.applyBeliefConjunctionRight },
+    { name: 'said-conj', apply: rules_1.applySaidConjunction },
+];
+/**
+ * Aplica las reglas BAN al estado hasta punto fijo. Devuelve el estado
+ * saturado y la lista de derivaciones nuevas (no incluye las iniciales).
+ */
+function saturate(initial, opts) {
+    const maxIter = opts?.maxIterations ?? 200;
+    const maxDeriv = opts?.maxDerivations ?? 1024;
+    const state = [];
+    const trace = [];
+    const tryAdd = (f) => {
+        if (state.some((g) => (0, terms_1.formulaEquals)(g, f)))
+            return false;
+        state.push(f);
+        return true;
+    };
+    for (const f of initial)
+        tryAdd(f);
+    let iter = 0;
+    let changed = true;
+    while (changed && iter < maxIter && trace.length < maxDeriv) {
+        changed = false;
+        iter++;
+        // Snapshot del estado para iterar de forma estable.
+        const snapshot = state.slice();
+        for (const focus of snapshot) {
+            // Reglas state+focus.
+            for (const rule of STATE_RULES) {
+                const out = rule.apply(snapshot, focus);
+                if (out && tryAdd(out)) {
+                    trace.push(out);
+                    changed = true;
+                    if (trace.length >= maxDeriv)
+                        return { state, trace };
+                }
+            }
+            // Reglas focus-only.
+            for (const rule of FOCUS_ONLY_RULES) {
+                const out = rule.apply(focus);
+                if (out && tryAdd(out)) {
+                    trace.push(out);
+                    changed = true;
+                    if (trace.length >= maxDeriv)
+                        return { state, trace };
+                }
+            }
+        }
+    }
+    return { state, trace };
+}
+/**
+ * Idealización mínima: cada step `from → to: msg` produce la
+ * fórmula `to ◁ msg`. Asumimos que el receptor literalmente ve el
+ * mensaje que se le envía.
+ *
+ * (BAN tradicional pide idealización manual para descartar texto
+ * inseguro como nombres en claro; aquí preservamos todos los
+ * subtérminos, que es la lectura conservadora.)
+ */
+function idealize(p) {
+    return p.steps.map((s) => (0, terms_1.sees)((0, terms_1.principal)(s.to), s.message));
+}
+/**
+ * Analiza un protocolo: parte de las assumptions + idealización,
+ * satura, y verifica goals.
+ */
+function analyzeProtocol(p, opts) {
+    const idealized = idealize(p);
+    const initial = [...p.initialAssumptions, ...idealized];
+    const { state, trace } = saturate(initial, opts);
+    const satisfied = [];
+    const unsatisfied = [];
+    for (const g of p.goals) {
+        if ((0, terms_1.hasFormula)(state, g))
+            satisfied.push(g);
+        else
+            unsatisfied.push(g);
+    }
+    return { satisfied, unsatisfied, trace };
+}
+//# sourceMappingURL=analyze.js.map

package/dist/reasoning/ban-logic/analyze.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analyze.js","sourceRoot":"","sources":["../../../src/reasoning/ban-logic/analyze.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4DAA4D;AAC5D,+DAA+D;AAC/D,EAAE;AACF,iEAAiE;AACjE,iEAAiE;AACjE,qDAAqD;AACrD,EAAE;AACF,wEAAwE;AACxE,wEAAwE;AACxE,uDAAuD;;AAmDvD,4BA+CC;AAWD,4BAEC;AAMD,0CAYC;AA/HD,mCAYiB;AACjB,mCAAqE;AAerE,MAAM,WAAW,GAAmB;IAClC,EAAE,IAAI,EAAE,wBAAwB,EAAE,KAAK,EAAE,iCAAyB,EAAE;IACpE,EAAE,IAAI,EAAE,wBAAwB,EAAE,KAAK,EAAE,iCAAyB,EAAE;IACpE,EAAE,IAAI,EAAE,wBAAwB,EAAE,KAAK,EAAE,iCAAyB,EAAE;IACpE,EAAE,IAAI,EAAE,oBAAoB,EAAE,KAAK,EAAE,8BAAsB,EAAE;IAC7D,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,yBAAiB,EAAE;IAClD,EAAE,IAAI,EAAE,kBAAkB,EAAE,KAAK,EAAE,4BAAoB,EAAE;IACzD,EAAE,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,yBAAiB,EAAE;IACnD,EAAE,IAAI,EAAE,uBAAuB,EAAE,KAAK,EAAE,iCAAyB,EAAE;CACpE,CAAC;AAEF,MAAM,gBAAgB,GAAoE;IACxF,EAAE,IAAI,EAAE,kBAAkB,EAAE,KAAK,EAAE,8BAAsB,EAAE;IAC3D,EAAE,IAAI,EAAE,mBAAmB,EAAE,KAAK,EAAE,mCAA2B,EAAE;IACjE,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,4BAAoB,EAAE;CACnD,CAAC;AAEF;;;GAGG;AACH,SAAgB,QAAQ,CACtB,OAAkC,EAClC,IAAsB;IAEtB,MAAM,OAAO,GAAG,IAAI,EAAE,aAAa,IAAI,GAAG,CAAC;IAC3C,MAAM,QAAQ,GAAG,IAAI,EAAE,cAAc,IAAI,IAAI,CAAC;IAE9C,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAiB,EAAE,CAAC;IAE/B,MAAM,MAAM,GAAG,CAAC,CAAa,EAAW,EAAE;QACxC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,qBAAa,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QACzD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAEnC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,IAAI,IAAI,GAAG,OAAO,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;QAC5D,OAAO,GAAG,KAAK,CAAC;QAChB,IAAI,EAAE,CAAC;QACP,oDAAoD;QACpD,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,sBAAsB;YACtB,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;gBAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;gBACxC,IAAI,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;oBACvB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAChB,OAAO,GAAG,IAAI,CAAC;oBACf,IAAI,KAAK,CAAC,MAAM,IAAI,QAAQ;wBAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;gBACxD,CAAC;YACH,CAAC;YACD,qBAAqB;YACrB,KAAK,MAAM,IAAI,IAAI,gBAAgB,EAAE,CAAC;gBACpC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBAC9B,IAAI,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;oBACvB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAChB,OAAO,GAAG,IAAI,CAAC;oBACf,IAAI,KAAK,CAAC,MAAM,IAAI,QAAQ;wBAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;gBACxD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,QAAQ,CAAC,CAAW;IAClC,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,YAAI,EAAC,IAAA,iBAAS,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;GAGG;AACH,SAAgB,eAAe,CAAC,CAAW,EAAE,IAAsB;IACjE,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,kBAAkB,EAAE,GAAG,SAAS,CAAC,CAAC;IACxD,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAEjD,MAAM,SAAS,GAAiB,EAAE,CAAC;IACnC,MAAM,WAAW,GAAiB,EAAE,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,IAAA,kBAAU,EAAC,KAAK,EAAE,CAAC,CAAC;YAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YACvC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;AAC3C,CAAC"}

package/dist/reasoning/ban-logic/index.d.ts

@@ -0,0 +1,7 @@
+export type { BANFormula, BANRule, BANTerm, Protocol, ProtocolAnalysis, ProtocolStep, } from './types';
+export { atom, compound, encrypted, hashed, key, message, nonce, principal, believes, controls, formulaAnd, fresh, jurisdiction, publicKey, said, saidMessage, sees, sharedKey, sharedSecret, formulaEquals, formulaToString, hasFormula, termEquals, termToString, } from './terms';
+export { applyBeliefConjunction, applyBeliefConjunctionRight, applyFreshnessPropagation, applyJurisdiction, applyMessageMeaningPublic, applyMessageMeaningSecret, applyMessageMeaningShared, applyNonceVerification, applySaidConjunction, applySeeingEncrypted, applySeesCompound, RULES_REGISTRY, } from './rules';
+export type { SaturateOptions } from './analyze';
+export { analyzeProtocol, idealize, saturate } from './analyze';
+export { kerberos, needhamSchroederPublicKey, needhamSchroederSymmetric } from './protocols';
+//# sourceMappingURL=index.d.ts.map

package/dist/reasoning/ban-logic/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/reasoning/ban-logic/index.ts"],"names":[],"mappings":"AAcA,YAAY,EACV,UAAU,EACV,OAAO,EACP,OAAO,EACP,QAAQ,EACR,gBAAgB,EAChB,YAAY,GACb,MAAM,SAAS,CAAC;AAEjB,OAAO,EAEL,IAAI,EACJ,QAAQ,EACR,SAAS,EACT,MAAM,EACN,GAAG,EACH,OAAO,EACP,KAAK,EACL,SAAS,EAET,QAAQ,EACR,QAAQ,EACR,UAAU,EACV,KAAK,EACL,YAAY,EACZ,SAAS,EACT,IAAI,EACJ,WAAW,EACX,IAAI,EACJ,SAAS,EACT,YAAY,EAEZ,aAAa,EACb,eAAe,EACf,UAAU,EACV,UAAU,EACV,YAAY,GACb,MAAM,SAAS,CAAC;AAEjB,OAAO,EACL,sBAAsB,EACtB,2BAA2B,EAC3B,yBAAyB,EACzB,iBAAiB,EACjB,yBAAyB,EACzB,yBAAyB,EACzB,yBAAyB,EACzB,sBAAsB,EACtB,oBAAoB,EACpB,oBAAoB,EACpB,iBAAiB,EACjB,cAAc,GACf,MAAM,SAAS,CAAC;AAEjB,YAAY,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAEhE,OAAO,EAAE,QAAQ,EAAE,yBAAyB,EAAE,yBAAyB,EAAE,MAAM,aAAa,CAAC"}

package/dist/reasoning/ban-logic/index.js

@@ -0,0 +1,66 @@
+"use strict";
+// ============================================================
+// BAN Logic — Barrel export
+// ============================================================
+//
+// Burrows-Abadi-Needham logic para verificación de protocolos
+// criptográficos de autenticación.
+//
+// API pública:
+//   - Constructores de términos y fórmulas (`principal`, `key`, ...)
+//   - Reglas de inferencia (R1-R10 y variantes)
+//   - `saturate(initial)` para cerrar un estado bajo las reglas
+//   - `analyzeProtocol(p)` para evaluar goals de un Protocol
+//   - Protocolos pre-armados: Needham-Schroeder symmetric / PK / Kerberos
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.needhamSchroederSymmetric = exports.needhamSchroederPublicKey = exports.kerberos = exports.saturate = exports.idealize = exports.analyzeProtocol = exports.RULES_REGISTRY = exports.applySeesCompound = exports.applySeeingEncrypted = exports.applySaidConjunction = exports.applyNonceVerification = exports.applyMessageMeaningShared = exports.applyMessageMeaningSecret = exports.applyMessageMeaningPublic = exports.applyJurisdiction = exports.applyFreshnessPropagation = exports.applyBeliefConjunctionRight = exports.applyBeliefConjunction = exports.termToString = exports.termEquals = exports.hasFormula = exports.formulaToString = exports.formulaEquals = exports.sharedSecret = exports.sharedKey = exports.sees = exports.saidMessage = exports.said = exports.publicKey = exports.jurisdiction = exports.fresh = exports.formulaAnd = exports.controls = exports.believes = exports.principal = exports.nonce = exports.message = exports.key = exports.hashed = exports.encrypted = exports.compound = exports.atom = void 0;
+var terms_1 = require("./terms");
+// Constructores de términos
+Object.defineProperty(exports, "atom", { enumerable: true, get: function () { return terms_1.atom; } });
+Object.defineProperty(exports, "compound", { enumerable: true, get: function () { return terms_1.compound; } });
+Object.defineProperty(exports, "encrypted", { enumerable: true, get: function () { return terms_1.encrypted; } });
+Object.defineProperty(exports, "hashed", { enumerable: true, get: function () { return terms_1.hashed; } });
+Object.defineProperty(exports, "key", { enumerable: true, get: function () { return terms_1.key; } });
+Object.defineProperty(exports, "message", { enumerable: true, get: function () { return terms_1.message; } });
+Object.defineProperty(exports, "nonce", { enumerable: true, get: function () { return terms_1.nonce; } });
+Object.defineProperty(exports, "principal", { enumerable: true, get: function () { return terms_1.principal; } });
+// Constructores de fórmulas
+Object.defineProperty(exports, "believes", { enumerable: true, get: function () { return terms_1.believes; } });
+Object.defineProperty(exports, "controls", { enumerable: true, get: function () { return terms_1.controls; } });
+Object.defineProperty(exports, "formulaAnd", { enumerable: true, get: function () { return terms_1.formulaAnd; } });
+Object.defineProperty(exports, "fresh", { enumerable: true, get: function () { return terms_1.fresh; } });
+Object.defineProperty(exports, "jurisdiction", { enumerable: true, get: function () { return terms_1.jurisdiction; } });
+Object.defineProperty(exports, "publicKey", { enumerable: true, get: function () { return terms_1.publicKey; } });
+Object.defineProperty(exports, "said", { enumerable: true, get: function () { return terms_1.said; } });
+Object.defineProperty(exports, "saidMessage", { enumerable: true, get: function () { return terms_1.saidMessage; } });
+Object.defineProperty(exports, "sees", { enumerable: true, get: function () { return terms_1.sees; } });
+Object.defineProperty(exports, "sharedKey", { enumerable: true, get: function () { return terms_1.sharedKey; } });
+Object.defineProperty(exports, "sharedSecret", { enumerable: true, get: function () { return terms_1.sharedSecret; } });
+// Equality + printing
+Object.defineProperty(exports, "formulaEquals", { enumerable: true, get: function () { return terms_1.formulaEquals; } });
+Object.defineProperty(exports, "formulaToString", { enumerable: true, get: function () { return terms_1.formulaToString; } });
+Object.defineProperty(exports, "hasFormula", { enumerable: true, get: function () { return terms_1.hasFormula; } });
+Object.defineProperty(exports, "termEquals", { enumerable: true, get: function () { return terms_1.termEquals; } });
+Object.defineProperty(exports, "termToString", { enumerable: true, get: function () { return terms_1.termToString; } });
+var rules_1 = require("./rules");
+Object.defineProperty(exports, "applyBeliefConjunction", { enumerable: true, get: function () { return rules_1.applyBeliefConjunction; } });
+Object.defineProperty(exports, "applyBeliefConjunctionRight", { enumerable: true, get: function () { return rules_1.applyBeliefConjunctionRight; } });
+Object.defineProperty(exports, "applyFreshnessPropagation", { enumerable: true, get: function () { return rules_1.applyFreshnessPropagation; } });
+Object.defineProperty(exports, "applyJurisdiction", { enumerable: true, get: function () { return rules_1.applyJurisdiction; } });
+Object.defineProperty(exports, "applyMessageMeaningPublic", { enumerable: true, get: function () { return rules_1.applyMessageMeaningPublic; } });
+Object.defineProperty(exports, "applyMessageMeaningSecret", { enumerable: true, get: function () { return rules_1.applyMessageMeaningSecret; } });
+Object.defineProperty(exports, "applyMessageMeaningShared", { enumerable: true, get: function () { return rules_1.applyMessageMeaningShared; } });
+Object.defineProperty(exports, "applyNonceVerification", { enumerable: true, get: function () { return rules_1.applyNonceVerification; } });
+Object.defineProperty(exports, "applySaidConjunction", { enumerable: true, get: function () { return rules_1.applySaidConjunction; } });
+Object.defineProperty(exports, "applySeeingEncrypted", { enumerable: true, get: function () { return rules_1.applySeeingEncrypted; } });
+Object.defineProperty(exports, "applySeesCompound", { enumerable: true, get: function () { return rules_1.applySeesCompound; } });
+Object.defineProperty(exports, "RULES_REGISTRY", { enumerable: true, get: function () { return rules_1.RULES_REGISTRY; } });
+var analyze_1 = require("./analyze");
+Object.defineProperty(exports, "analyzeProtocol", { enumerable: true, get: function () { return analyze_1.analyzeProtocol; } });
+Object.defineProperty(exports, "idealize", { enumerable: true, get: function () { return analyze_1.idealize; } });
+Object.defineProperty(exports, "saturate", { enumerable: true, get: function () { return analyze_1.saturate; } });
+var protocols_1 = require("./protocols");
+Object.defineProperty(exports, "kerberos", { enumerable: true, get: function () { return protocols_1.kerberos; } });
+Object.defineProperty(exports, "needhamSchroederPublicKey", { enumerable: true, get: function () { return protocols_1.needhamSchroederPublicKey; } });
+Object.defineProperty(exports, "needhamSchroederSymmetric", { enumerable: true, get: function () { return protocols_1.needhamSchroederSymmetric; } });
+//# sourceMappingURL=index.js.map

package/dist/reasoning/ban-logic/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/reasoning/ban-logic/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4BAA4B;AAC5B,+DAA+D;AAC/D,EAAE;AACF,8DAA8D;AAC9D,mCAAmC;AACnC,EAAE;AACF,eAAe;AACf,qEAAqE;AACrE,gDAAgD;AAChD,gEAAgE;AAChE,6DAA6D;AAC7D,0EAA0E;;;AAW1E,iCA4BiB;AA3Bf,4BAA4B;AAC5B,6FAAA,IAAI,OAAA;AACJ,iGAAA,QAAQ,OAAA;AACR,kGAAA,SAAS,OAAA;AACT,+FAAA,MAAM,OAAA;AACN,4FAAA,GAAG,OAAA;AACH,gGAAA,OAAO,OAAA;AACP,8FAAA,KAAK,OAAA;AACL,kGAAA,SAAS,OAAA;AACT,4BAA4B;AAC5B,iGAAA,QAAQ,OAAA;AACR,iGAAA,QAAQ,OAAA;AACR,mGAAA,UAAU,OAAA;AACV,8FAAA,KAAK,OAAA;AACL,qGAAA,YAAY,OAAA;AACZ,kGAAA,SAAS,OAAA;AACT,6FAAA,IAAI,OAAA;AACJ,oGAAA,WAAW,OAAA;AACX,6FAAA,IAAI,OAAA;AACJ,kGAAA,SAAS,OAAA;AACT,qGAAA,YAAY,OAAA;AACZ,sBAAsB;AACtB,sGAAA,aAAa,OAAA;AACb,wGAAA,eAAe,OAAA;AACf,mGAAA,UAAU,OAAA;AACV,mGAAA,UAAU,OAAA;AACV,qGAAA,YAAY,OAAA;AAGd,iCAaiB;AAZf,+GAAA,sBAAsB,OAAA;AACtB,oHAAA,2BAA2B,OAAA;AAC3B,kHAAA,yBAAyB,OAAA;AACzB,0GAAA,iBAAiB,OAAA;AACjB,kHAAA,yBAAyB,OAAA;AACzB,kHAAA,yBAAyB,OAAA;AACzB,kHAAA,yBAAyB,OAAA;AACzB,+GAAA,sBAAsB,OAAA;AACtB,6GAAA,oBAAoB,OAAA;AACpB,6GAAA,oBAAoB,OAAA;AACpB,0GAAA,iBAAiB,OAAA;AACjB,uGAAA,cAAc,OAAA;AAIhB,qCAAgE;AAAvD,0GAAA,eAAe,OAAA;AAAE,mGAAA,QAAQ,OAAA;AAAE,mGAAA,QAAQ,OAAA;AAE5C,yCAA6F;AAApF,qGAAA,QAAQ,OAAA;AAAE,sHAAA,yBAAyB,OAAA;AAAE,sHAAA,yBAAyB,OAAA"}