@stevenvo780/st-lang 4.1.0 → 4.2.0

package/dist/profiles/ltl-sat/sat.js

@@ -0,0 +1,140 @@
+"use strict";
+// ============================================================
+// ST LTL-SAT — Decisor SAT vía búsqueda de lazo aceptante
+// ============================================================
+// Algoritmo (Vardi-Wolper en versión explícita):
+//
+//   1. NNF + clausura + enumerar atoms localmente consistentes.
+//   2. Construir relación de transición sobre atoms.
+//   3. Filtrar atoms iniciales: aquellos que contienen φ.
+//   4. SAT(φ) ⇔ existe lazo (prefix → loop) accesible desde un
+//      atom inicial donde, para cada eventualidad presente en
+//      cualquier atom del lazo, hay un atom del lazo donde el
+//      "witness" está presente.
+//
+// La construcción es exponencial en |φ|; suficiente para fórmulas
+// pedagógicas y tests (≤ ~15 operadores). No es competitivo con
+// SPOT, pero es correcto y didáctico.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isSatisfiable = isSatisfiable;
+exports.isValid = isValid;
+exports.toBuchi = toBuchi;
+const tableau_1 = require("./tableau");
+const types_1 = require("./types");
+function buildModel(phi) {
+    const nnf = (0, tableau_1.toNNF)(phi);
+    const close = (0, tableau_1.closure)(nnf);
+    const atoms = (0, tableau_1.enumerateAtoms)(close);
+    const succ = (0, tableau_1.transitions)(atoms);
+    const initialKey = (0, types_1.formulaKey)(nnf);
+    const initialIds = atoms.filter((a) => a.formulas.has(initialKey)).map((a) => a.id);
+    return { atoms, succ, initialIds };
+}
+// Para cada eventualidad que aparece en algún atom del ciclo, debe haber
+// un atom del ciclo donde el witness se cumple. Verificamos sobre la
+// secuencia ordenada `loop`.
+function fulfillsAllEventualities(atoms, loop) {
+    // Recolectamos las eventualidades que aparecen en TODOS los estados
+    // del lazo (porque cuando una eventualidad cruza el corte X-F φ del lazo
+    // debe cumplirse). Más simple: para cada eventualidad presente en al
+    // menos un estado del ciclo, debe haber un estado con el witness.
+    const pendingByEv = new Map();
+    for (const id of loop) {
+        const a = atoms[id];
+        for (const ev of (0, tableau_1.eventualitiesIn)(a)) {
+            if (!pendingByEv.has(ev.key))
+                pendingByEv.set(ev.key, ev.witnessFormulaKey);
+        }
+    }
+    for (const [, witnessKey] of pendingByEv) {
+        let satisfied = false;
+        for (const id of loop) {
+            if (atoms[id].formulas.has(witnessKey)) {
+                satisfied = true;
+                break;
+            }
+        }
+        if (!satisfied)
+            return false;
+    }
+    return true;
+}
+// Búsqueda: DFS desde cada inicial, explorando todos los caminos
+// simples extendidos en busca de un lazo aceptante. Como los grafos son
+// pequeños (caps internos), una exploración exhaustiva acotada basta.
+function searchLasso(model) {
+    const { atoms, succ, initialIds } = model;
+    const N = atoms.length;
+    if (N === 0 || initialIds.length === 0)
+        return null;
+    // Soft cap para evitar explosión combinatoria.
+    const MAX_PATH_LEN = Math.min(N + 6, 60);
+    for (const start of initialIds) {
+        const path = [start];
+        const pathPos = new Map();
+        pathPos.set(start, 0);
+        const found = dfs(start, path, pathPos);
+        if (found)
+            return found;
+    }
+    return null;
+    function dfs(node, path, pathPos) {
+        const successors = succ.get(node) ?? [];
+        for (const next of successors) {
+            const cycleIdx = pathPos.get(next);
+            if (cycleIdx !== undefined) {
+                // Tenemos lazo: prefix = path[0..idx-1], loop = path[idx..end].
+                const prefix = path.slice(0, cycleIdx);
+                const loop = path.slice(cycleIdx);
+                if (loop.length > 0 && fulfillsAllEventualities(atoms, loop)) {
+                    return { prefix, loop };
+                }
+                // Si no aceptante, intentamos otros sucesores (no recursamos por
+                // este nodo ya visitado en el path actual).
+                continue;
+            }
+            if (path.length >= MAX_PATH_LEN)
+                continue;
+            path.push(next);
+            pathPos.set(next, path.length - 1);
+            const r = dfs(next, path, pathPos);
+            if (r)
+                return r;
+            path.pop();
+            pathPos.delete(next);
+        }
+        return null;
+    }
+}
+function atomLabel(a) {
+    return (0, tableau_1.describeAtom)(a);
+}
+function isSatisfiable(phi) {
+    const model = buildModel(phi);
+    const lasso = searchLasso(model);
+    if (!lasso)
+        return { sat: false };
+    const witness = {
+        prefix: lasso.prefix.map((id) => atomLabel(model.atoms[id])),
+        loop: lasso.loop.map((id) => atomLabel(model.atoms[id])),
+    };
+    return { sat: true, witness };
+}
+function isValid(phi) {
+    const negated = (0, types_1.not)(phi);
+    return !isSatisfiable(negated).sat;
+}
+// Estimación de tamaño del autómata estilo Büchi: cuenta atoms (estados)
+// y cuántos de ellos pueden ser "aceptantes" para alguna eventualidad
+// (heurística simple: estados que no tienen eventualidades pendientes).
+function toBuchi(phi) {
+    const model = buildModel(phi);
+    let accepting = 0;
+    for (const a of model.atoms) {
+        if ((0, tableau_1.eventualitiesIn)(a).length === 0)
+            accepting += 1;
+    }
+    return { states: model.atoms.length, accepting };
+}
+//# sourceMappingURL=sat.js.map

package/dist/profiles/ltl-sat/sat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sat.js","sourceRoot":"","sources":["../../../src/profiles/ltl-sat/sat.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,0DAA0D;AAC1D,+DAA+D;AAC/D,iDAAiD;AACjD,EAAE;AACF,gEAAgE;AAChE,qDAAqD;AACrD,0DAA0D;AAC1D,+DAA+D;AAC/D,8DAA8D;AAC9D,8DAA8D;AAC9D,gCAAgC;AAChC,EAAE;AACF,kEAAkE;AAClE,gEAAgE;AAChE,sCAAsC;AACtC,+DAA+D;;AAiH/D,sCASC;AAED,0BAGC;AAKD,0BAOC;AAzID,uCAQmB;AACnB,mCAA0E;AAQ1E,SAAS,UAAU,CAAC,GAAe;IACjC,MAAM,GAAG,GAAG,IAAA,eAAK,EAAC,GAAG,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,IAAA,iBAAO,EAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,KAAK,GAAG,IAAA,wBAAc,EAAC,KAAK,CAAC,CAAC;IACpC,MAAM,IAAI,GAAG,IAAA,qBAAW,EAAC,KAAK,CAAC,CAAC;IAChC,MAAM,UAAU,GAAG,IAAA,kBAAU,EAAC,GAAG,CAAC,CAAC;IACnC,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACpF,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;AACrC,CAAC;AAED,yEAAyE;AACzE,qEAAqE;AACrE,6BAA6B;AAC7B,SAAS,wBAAwB,CAAC,KAAa,EAAE,IAAc;IAC7D,oEAAoE;IACpE,yEAAyE;IACzE,qEAAqE;IACrE,kEAAkE;IAClE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;QACpB,KAAK,MAAM,EAAE,IAAI,IAAA,yBAAe,EAAC,CAAC,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC;gBAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC;QAC9E,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,EAAE,UAAU,CAAC,IAAI,WAAW,EAAE,CAAC;QACzC,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACtB,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBACvC,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS;YAAE,OAAO,KAAK,CAAC;IAC/B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,iEAAiE;AACjE,wEAAwE;AACxE,sEAAsE;AACtE,SAAS,WAAW,CAAC,KAAiB;IACpC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC;IAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEpD,+CAA+C;IAC/C,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IAEzC,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAa,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEtB,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QACxC,IAAI,KAAK;YAAE,OAAO,KAAK,CAAC;IAC1B,CAAC;IACD,OAAO,IAAI,CAAC;IAEZ,SAAS,GAAG,CACV,IAAY,EACZ,IAAc,EACd,OAA4B;QAE5B,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,gEAAgE;gBAChE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;gBACvC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBAClC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,wBAAwB,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC7D,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;gBAC1B,CAAC;gBACD,iEAAiE;gBACjE,4CAA4C;gBAC5C,SAAS;YACX,CAAC;YACD,IAAI,IAAI,CAAC,MAAM,IAAI,YAAY;gBAAE,SAAS;YAC1C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;YACnC,IAAI,CAAC;gBAAE,OAAO,CAAC,CAAC;YAChB,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,CAAO;IACxB,OAAO,IAAA,sBAAY,EAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAED,SAAgB,aAAa,CAAC,GAAe;IAC3C,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACjC,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;IAClC,MAAM,OAAO,GAAY;QACvB,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;KACzD,CAAC;IACF,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAChC,CAAC;AAED,SAAgB,OAAO,CAAC,GAAe;IACrC,MAAM,OAAO,GAAG,IAAA,WAAG,EAAC,GAAG,CAAC,CAAC;IACzB,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC;AACrC,CAAC;AAED,yEAAyE;AACzE,sEAAsE;AACtE,wEAAwE;AACxE,SAAgB,OAAO,CAAC,GAAe;IACrC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;IAC9B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,IAAA,yBAAe,EAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS,IAAI,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC;AACnD,CAAC"}

package/dist/profiles/ltl-sat/tableau.d.ts

@@ -0,0 +1,19 @@
+import { LTLFormula } from './types';
+export declare function toNNF(f: LTLFormula): LTLFormula;
+export declare function closure(f: LTLFormula): LTLFormula[];
+export interface Atom {
+    id: number;
+    formulas: Map<string, LTLFormula>;
+    positiveLiterals: string[];
+    negativeLiterals: string[];
+}
+export declare function enumerateAtoms(closureFormulas: LTLFormula[]): Atom[];
+export declare function transitions(atoms: Atom[]): Map<number, number[]>;
+export interface Eventuality {
+    key: string;
+    witnessFormulaKey: string;
+}
+export declare function eventualitiesIn(atom: Atom): Eventuality[];
+export declare function describeAtom(a: Atom): string;
+export declare function describeFormula(f: LTLFormula): string;
+//# sourceMappingURL=tableau.d.ts.map

package/dist/profiles/ltl-sat/tableau.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tableau.d.ts","sourceRoot":"","sources":["../../../src/profiles/ltl-sat/tableau.ts"],"names":[],"mappings":"AAqBA,OAAO,EAAE,UAAU,EAA+B,MAAM,SAAS,CAAC;AAIlE,wBAAgB,KAAK,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU,CAE/C;AAgED,wBAAgB,OAAO,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU,EAAE,CA6CnD;AAID,MAAM,WAAW,IAAI;IACnB,EAAE,EAAE,MAAM,CAAC;IAEX,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAElC,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,gBAAgB,EAAE,MAAM,EAAE,CAAC;CAC5B;AAqFD,wBAAgB,cAAc,CAAC,eAAe,EAAE,UAAU,EAAE,GAAG,IAAI,EAAE,CAgEpE;AAWD,wBAAgB,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAwBhE;AAOD,MAAM,WAAW,WAAW;IAC1B,GAAG,EAAE,MAAM,CAAC;IAGZ,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED,wBAAgB,eAAe,CAAC,IAAI,EAAE,IAAI,GAAG,WAAW,EAAE,CAUzD;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAK5C;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,UAAU,GAAG,MAAM,CAErD"}

package/dist/profiles/ltl-sat/tableau.js

@@ -0,0 +1,358 @@
+"use strict";
+// ============================================================
+// ST LTL-SAT — Tableau / construcción de autómata estilo Büchi
+// ============================================================
+// Procedimiento de decisión clásico (Wolper, Vardi-Wolper):
+//
+//   1. Normalizar a NNF (negaciones empujadas hasta átomos).
+//   2. Cerrar bajo subfórmulas y duales.
+//   3. Generar "atoms" = subconjuntos máximalmente consistentes
+//      de la clausura que cumplen las reglas locales de tableau
+//      (α/β rules: una ∧ requiere ambas conyuntas; una ∨
+//      requiere ≥1 disyunta; etc.).
+//   4. Construir transición: atom A → atom B sii cada Xφ ∈ A
+//      cumple φ ∈ B (y nada más restringe el siguiente estado).
+//   5. Decidir SAT: existe lazo accesible desde un átomo que
+//      contiene φ tal que cada eventualidad (F ψ o φ U ψ) se
+//      cumple en el ciclo (presencia de ψ).
+//
+// El procedimiento es decidible: 2^O(|φ|) atoms, búsqueda de
+// lazo en el grafo resultante (NL en el tamaño del grafo).
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.toNNF = toNNF;
+exports.closure = closure;
+exports.enumerateAtoms = enumerateAtoms;
+exports.transitions = transitions;
+exports.eventualitiesIn = eventualitiesIn;
+exports.describeAtom = describeAtom;
+exports.describeFormula = describeFormula;
+const types_1 = require("./types");
+// --- NNF: negation normal form -----------------------------------------------
+function toNNF(f) {
+    return pushNot(f, false);
+}
+function pushNot(f, negated) {
+    switch (f.kind) {
+        case 'atom':
+            return negated ? { kind: 'not', arg: f } : f;
+        case 'not':
+            return pushNot(f.arg, !negated);
+        case 'and':
+            if (negated) {
+                return { kind: 'or', args: f.args.map((a) => pushNot(a, true)) };
+            }
+            return { kind: 'and', args: f.args.map((a) => pushNot(a, false)) };
+        case 'or':
+            if (negated) {
+                return { kind: 'and', args: f.args.map((a) => pushNot(a, true)) };
+            }
+            return { kind: 'or', args: f.args.map((a) => pushNot(a, false)) };
+        case 'X':
+            // ¬X φ ≡ X ¬φ  (en LTL lineal el next es funcional).
+            return { kind: 'X', arg: pushNot(f.arg, negated) };
+        case 'F':
+            // ¬F φ ≡ G ¬φ
+            return negated
+                ? { kind: 'G', arg: pushNot(f.arg, true) }
+                : { kind: 'F', arg: pushNot(f.arg, false) };
+        case 'G':
+            // ¬G φ ≡ F ¬φ
+            return negated
+                ? { kind: 'F', arg: pushNot(f.arg, true) }
+                : { kind: 'G', arg: pushNot(f.arg, false) };
+        case 'U':
+            // ¬(φ U ψ) ≡ (¬ψ) R (¬φ)
+            if (negated) {
+                return {
+                    kind: 'R',
+                    left: pushNot(f.right, true),
+                    right: pushNot(f.left, true),
+                };
+            }
+            return {
+                kind: 'U',
+                left: pushNot(f.left, false),
+                right: pushNot(f.right, false),
+            };
+        case 'R':
+            // ¬(φ R ψ) ≡ (¬φ) U (¬ψ)
+            if (negated) {
+                return {
+                    kind: 'U',
+                    left: pushNot(f.left, true),
+                    right: pushNot(f.right, true),
+                };
+            }
+            return {
+                kind: 'R',
+                left: pushNot(f.left, false),
+                right: pushNot(f.right, false),
+            };
+    }
+}
+// --- Closure ----------------------------------------------------------------
+function closure(f) {
+    const seen = new Map();
+    function visit(g) {
+        const k = (0, types_1.formulaKey)(g);
+        if (seen.has(k))
+            return;
+        seen.set(k, g);
+        switch (g.kind) {
+            case 'atom':
+                return;
+            case 'not':
+                visit(g.arg);
+                return;
+            case 'and':
+            case 'or':
+                g.args.forEach(visit);
+                return;
+            case 'X':
+                visit(g.arg);
+                return;
+            case 'F':
+                // F φ ≡ φ ∨ X F φ; añadimos también X F φ a la clausura.
+                visit(g.arg);
+                visit({ kind: 'X', arg: g });
+                return;
+            case 'G':
+                // G φ ≡ φ ∧ X G φ
+                visit(g.arg);
+                visit({ kind: 'X', arg: g });
+                return;
+            case 'U':
+                // φ U ψ ≡ ψ ∨ (φ ∧ X(φ U ψ))
+                visit(g.left);
+                visit(g.right);
+                visit({ kind: 'X', arg: g });
+                return;
+            case 'R':
+                // φ R ψ ≡ ψ ∧ (φ ∨ X(φ R ψ))
+                visit(g.left);
+                visit(g.right);
+                visit({ kind: 'X', arg: g });
+                return;
+        }
+    }
+    visit(f);
+    return Array.from(seen.values());
+}
+// Devuelve true si la asignación parcial `present` es localmente consistente
+// con respecto a las reglas tableau y *contiene* todas las fórmulas que se
+// derivan obligatoriamente de las que ya están dentro.
+function isLocallyConsistent(present, byKey) {
+    for (const [k, f] of byKey) {
+        if (!present.has(k))
+            continue;
+        switch (f.kind) {
+            case 'atom': {
+                const negKey = `n:${k}`;
+                if (present.has(negKey))
+                    return false;
+                break;
+            }
+            case 'not': {
+                if (f.arg.kind === 'atom') {
+                    // ¬p: p no debe estar.
+                    if (present.has((0, types_1.formulaKey)(f.arg)))
+                        return false;
+                }
+                // Cualquier otro `not` no debería existir tras NNF.
+                break;
+            }
+            case 'and':
+                for (const a of f.args) {
+                    if (!present.has((0, types_1.formulaKey)(a)))
+                        return false;
+                }
+                break;
+            case 'or': {
+                // Al menos una disyunta presente.
+                let ok = false;
+                for (const a of f.args) {
+                    if (present.has((0, types_1.formulaKey)(a))) {
+                        ok = true;
+                        break;
+                    }
+                }
+                if (!ok)
+                    return false;
+                break;
+            }
+            case 'X':
+                // X φ no impone condiciones locales en el átomo actual; lo
+                // valida la relación de transición.
+                break;
+            case 'F': {
+                // F φ ≡ φ ∨ X F φ: φ presente o X(F φ) presente.
+                const phiKey = (0, types_1.formulaKey)(f.arg);
+                const xFphiKey = `X:${k}`;
+                if (!present.has(phiKey) && !present.has(xFphiKey))
+                    return false;
+                break;
+            }
+            case 'G': {
+                // G φ ≡ φ ∧ X G φ: ambas.
+                const phiKey = (0, types_1.formulaKey)(f.arg);
+                const xGphiKey = `X:${k}`;
+                if (!present.has(phiKey) || !present.has(xGphiKey))
+                    return false;
+                break;
+            }
+            case 'U': {
+                // φ U ψ ≡ ψ ∨ (φ ∧ X(φ U ψ))
+                const psiKey = (0, types_1.formulaKey)(f.right);
+                const phiKey = (0, types_1.formulaKey)(f.left);
+                const xUKey = `X:${k}`;
+                const optA = present.has(psiKey);
+                const optB = present.has(phiKey) && present.has(xUKey);
+                if (!optA && !optB)
+                    return false;
+                break;
+            }
+            case 'R': {
+                // φ R ψ ≡ ψ ∧ (φ ∨ X(φ R ψ))
+                const psiKey = (0, types_1.formulaKey)(f.right);
+                const phiKey = (0, types_1.formulaKey)(f.left);
+                const xRKey = `X:${k}`;
+                if (!present.has(psiKey))
+                    return false;
+                if (!present.has(phiKey) && !present.has(xRKey))
+                    return false;
+                break;
+            }
+        }
+    }
+    return true;
+}
+// Genera todos los atoms (subconjuntos de la clausura) localmente
+// consistentes. Para evitar explosión usamos enumeración por elección
+// de subfórmulas en orden tópico con poda temprana.
+function enumerateAtoms(closureFormulas) {
+    const byKey = new Map();
+    for (const g of closureFormulas)
+        byKey.set((0, types_1.formulaKey)(g), g);
+    // Particionamos en: átomos atómicos (incluyendo sus negaciones), y el resto.
+    // Para cada átomo proposicional decidimos true/false. Para el resto, lo
+    // derivamos por reglas; pero algunas elecciones quedan: ∨, U, R, F
+    // tienen disyunciones internas. Las enumeramos por subset de la clausura.
+    //
+    // Estrategia: enumerar sobre todos los subconjuntos de la clausura y
+    // filtrar por consistencia local. La clausura |Φ| ≤ O(|φ|*2). Para
+    // fórmulas pequeñas (~5-10 ops) esto da 2^20 ≈ 1M ⇒ aceptable en tests.
+    const keys = closureFormulas.map(types_1.formulaKey);
+    const atoms = [];
+    const n = keys.length;
+    // Búsqueda por backtracking con poda.
+    const present = new Set();
+    // Helper para chequeo de consistencia parcial: dado que el orden de
+    // selección es arbitrario, sólo evaluamos consistencia completa al final.
+    // (La poda más simple: cláusulas atom/¬atom contradictorias.)
+    function backtrack(i) {
+        if (atoms.length > 200000)
+            return; // safety hard cap
+        if (i === n) {
+            if (isLocallyConsistent(present, byKey)) {
+                const formulas = new Map();
+                const pos = [];
+                const neg = [];
+                for (const k of present) {
+                    const ff = byKey.get(k);
+                    if (!ff)
+                        continue;
+                    formulas.set(k, ff);
+                    if (ff.kind === 'atom')
+                        pos.push(ff.name);
+                    else if (ff.kind === 'not' && ff.arg.kind === 'atom')
+                        neg.push(ff.arg.name);
+                }
+                atoms.push({
+                    id: atoms.length,
+                    formulas,
+                    positiveLiterals: pos.sort(),
+                    negativeLiterals: neg.sort(),
+                });
+            }
+            return;
+        }
+        // Decide no incluir keys[i].
+        backtrack(i + 1);
+        // Decide incluir keys[i].
+        const k = keys[i];
+        const f = byKey.get(k);
+        if (!f)
+            return;
+        // Poda inmediata: si f es atom p y ¬p ya está, no incluir.
+        if (f.kind === 'atom') {
+            if (present.has(`n:${k}`))
+                return; // poda
+        }
+        else if (f.kind === 'not' && f.arg.kind === 'atom') {
+            if (present.has((0, types_1.formulaKey)(f.arg)))
+                return;
+        }
+        present.add(k);
+        backtrack(i + 1);
+        present.delete(k);
+    }
+    backtrack(0);
+    return atoms;
+}
+// --- Transition relation ----------------------------------------------------
+// A → B sii: para toda Xφ ∈ A, φ ∈ B. (No exigimos lo recíproco porque B
+// puede contener fórmulas "iniciales" de su estado.)
+//
+// IMPORTANTE: además, las fórmulas obligatorias de la siguiente generación
+// (F, G, U, R) deben mantenerse consistentes. La regla X-φ ∈ A ⇒ φ ∈ B
+// es suficiente porque la clausura ya contiene X(F φ), X(G φ), X(φ U ψ),
+// X(φ R ψ) explícitamente.
+function transitions(atoms) {
+    const out = new Map();
+    for (const a of atoms) {
+        // Recolectamos las obligaciones "next".
+        const nextObligations = [];
+        for (const f of a.formulas.values()) {
+            if (f.kind === 'X') {
+                nextObligations.push((0, types_1.formulaKey)(f.arg));
+            }
+        }
+        const succ = [];
+        for (const b of atoms) {
+            let ok = true;
+            for (const obl of nextObligations) {
+                if (!b.formulas.has(obl)) {
+                    ok = false;
+                    break;
+                }
+            }
+            if (ok)
+                succ.push(b.id);
+        }
+        out.set(a.id, succ);
+    }
+    return out;
+}
+function eventualitiesIn(atom) {
+    const ev = [];
+    for (const [k, f] of atom.formulas) {
+        if (f.kind === 'F') {
+            ev.push({ key: k, witnessFormulaKey: (0, types_1.formulaKey)(f.arg) });
+        }
+        else if (f.kind === 'U') {
+            ev.push({ key: k, witnessFormulaKey: (0, types_1.formulaKey)(f.right) });
+        }
+    }
+    return ev;
+}
+function describeAtom(a) {
+    const pos = a.positiveLiterals.join(',');
+    const neg = a.negativeLiterals.map((n) => `¬${n}`).join(',');
+    const all = [pos, neg].filter((s) => s.length > 0).join(',');
+    return all || '∅';
+}
+function describeFormula(f) {
+    return (0, types_1.formulaToString)(f);
+}
+//# sourceMappingURL=tableau.js.map

package/dist/profiles/ltl-sat/tableau.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tableau.js","sourceRoot":"","sources":["../../../src/profiles/ltl-sat/tableau.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,+DAA+D;AAC/D,+DAA+D;AAC/D,4DAA4D;AAC5D,EAAE;AACF,6DAA6D;AAC7D,yCAAyC;AACzC,gEAAgE;AAChE,gEAAgE;AAChE,yDAAyD;AACzD,oCAAoC;AACpC,6DAA6D;AAC7D,gEAAgE;AAChE,6DAA6D;AAC7D,6DAA6D;AAC7D,4CAA4C;AAC5C,EAAE;AACF,6DAA6D;AAC7D,2DAA2D;AAC3D,+DAA+D;;AAM/D,sBAEC;AAgED,0BA6CC;AAgGD,wCAgEC;AAWD,kCAwBC;AAcD,0CAUC;AAED,oCAKC;AAED,0CAEC;AAzVD,mCAAkE;AAElE,gFAAgF;AAEhF,SAAgB,KAAK,CAAC,CAAa;IACjC,OAAO,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAC3B,CAAC;AAED,SAAS,OAAO,CAAC,CAAa,EAAE,OAAgB;IAC9C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,KAAK,KAAK;YACR,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;QAClC,KAAK,KAAK;YACR,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YACnE,CAAC;YACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;QACrE,KAAK,IAAI;YACP,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YACpE,CAAC;YACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;QACpE,KAAK,GAAG;YACN,qDAAqD;YACrD,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;QACrD,KAAK,GAAG;YACN,cAAc;YACd,OAAO,OAAO;gBACZ,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE;gBAC1C,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC;QAChD,KAAK,GAAG;YACN,cAAc;YACd,OAAO,OAAO;gBACZ,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE;gBAC1C,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC;QAChD,KAAK,GAAG;YACN,yBAAyB;YACzB,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO;oBACL,IAAI,EAAE,GAAG;oBACT,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC;oBAC5B,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC;iBAC7B,CAAC;YACJ,CAAC;YACD,OAAO;gBACL,IAAI,EAAE,GAAG;gBACT,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC;gBAC5B,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC;aAC/B,CAAC;QACJ,KAAK,GAAG;YACN,yBAAyB;YACzB,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO;oBACL,IAAI,EAAE,GAAG;oBACT,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC;oBAC3B,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC;iBAC9B,CAAC;YACJ,CAAC;YACD,OAAO;gBACL,IAAI,EAAE,GAAG;gBACT,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC;gBAC5B,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC;aAC/B,CAAC;IACN,CAAC;AACH,CAAC;AAED,+EAA+E;AAE/E,SAAgB,OAAO,CAAC,CAAa;IACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC3C,SAAS,KAAK,CAAC,CAAa;QAC1B,MAAM,CAAC,GAAG,IAAA,kBAAU,EAAC,CAAC,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO;QACxB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACf,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,MAAM;gBACT,OAAO;YACT,KAAK,KAAK;gBACR,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACb,OAAO;YACT,KAAK,KAAK,CAAC;YACX,KAAK,IAAI;gBACP,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBACtB,OAAO;YACT,KAAK,GAAG;gBACN,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACb,OAAO;YACT,KAAK,GAAG;gBACN,yDAAyD;gBACzD,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACb,KAAK,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC7B,OAAO;YACT,KAAK,GAAG;gBACN,kBAAkB;gBAClB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACb,KAAK,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC7B,OAAO;YACT,KAAK,GAAG;gBACN,6BAA6B;gBAC7B,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACd,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACf,KAAK,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC7B,OAAO;YACT,KAAK,GAAG;gBACN,6BAA6B;gBAC7B,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACd,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACf,KAAK,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC7B,OAAO;QACX,CAAC;IACH,CAAC;IACD,KAAK,CAAC,CAAC,CAAC,CAAC;IACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AACnC,CAAC;AAaD,6EAA6E;AAC7E,2EAA2E;AAC3E,uDAAuD;AACvD,SAAS,mBAAmB,CAAC,OAAoB,EAAE,KAA8B;IAC/E,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAE9B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,MAAM,CAAC,CAAC,CAAC;gBACZ,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC;gBACxB,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACtC,MAAM;YACR,CAAC;YACD,KAAK,KAAK,CAAC,CAAC,CAAC;gBACX,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBAC1B,uBAAuB;oBACvB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAA,kBAAU,EAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;gBACnD,CAAC;gBACD,oDAAoD;gBACpD,MAAM;YACR,CAAC;YACD,KAAK,KAAK;gBACR,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;oBACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAA,kBAAU,EAAC,CAAC,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;gBAChD,CAAC;gBACD,MAAM;YACR,KAAK,IAAI,CAAC,CAAC,CAAC;gBACV,kCAAkC;gBAClC,IAAI,EAAE,GAAG,KAAK,CAAC;gBACf,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;oBACvB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAA,kBAAU,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC/B,EAAE,GAAG,IAAI,CAAC;wBACV,MAAM;oBACR,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,EAAE;oBAAE,OAAO,KAAK,CAAC;gBACtB,MAAM;YACR,CAAC;YACD,KAAK,GAAG;gBACN,2DAA2D;gBAC3D,oCAAoC;gBACpC,MAAM;YACR,KAAK,GAAG,CAAC,CAAC,CAAC;gBACT,iDAAiD;gBACjD,MAAM,MAAM,GAAG,IAAA,kBAAU,EAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACjE,MAAM;YACR,CAAC;YACD,KAAK,GAAG,CAAC,CAAC,CAAC;gBACT,0BAA0B;gBAC1B,MAAM,MAAM,GAAG,IAAA,kBAAU,EAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACjE,MAAM;YACR,CAAC;YACD,KAAK,GAAG,CAAC,CAAC,CAAC;gBACT,6BAA6B;gBAC7B,MAAM,MAAM,GAAG,IAAA,kBAAU,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACnC,MAAM,MAAM,GAAG,IAAA,kBAAU,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAClC,MAAM,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC;gBACvB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACjC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACvD,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI;oBAAE,OAAO,KAAK,CAAC;gBACjC,MAAM;YACR,CAAC;YACD,KAAK,GAAG,CAAC,CAAC,CAAC;gBACT,6BAA6B;gBAC7B,MAAM,MAAM,GAAG,IAAA,kBAAU,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACnC,MAAM,MAAM,GAAG,IAAA,kBAAU,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAClC,MAAM,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC;gBACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;gBAC9D,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,kEAAkE;AAClE,sEAAsE;AACtE,oDAAoD;AACpD,SAAgB,cAAc,CAAC,eAA6B;IAC1D,MAAM,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,eAAe;QAAE,KAAK,CAAC,GAAG,CAAC,IAAA,kBAAU,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE7D,6EAA6E;IAC7E,wEAAwE;IACxE,mEAAmE;IACnE,0EAA0E;IAC1E,EAAE;IACF,qEAAqE;IACrE,mEAAmE;IACnE,wEAAwE;IAExE,MAAM,IAAI,GAAG,eAAe,CAAC,GAAG,CAAC,kBAAU,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,sCAAsC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,oEAAoE;IACpE,0EAA0E;IAC1E,8DAA8D;IAC9D,SAAS,SAAS,CAAC,CAAS;QAC1B,IAAI,KAAK,CAAC,MAAM,GAAG,MAAM;YAAE,OAAO,CAAC,kBAAkB;QACrD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,IAAI,mBAAmB,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC;gBACxC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAC;gBAC/C,MAAM,GAAG,GAAa,EAAE,CAAC;gBACzB,MAAM,GAAG,GAAa,EAAE,CAAC;gBACzB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;oBACxB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACxB,IAAI,CAAC,EAAE;wBAAE,SAAS;oBAClB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACpB,IAAI,EAAE,CAAC,IAAI,KAAK,MAAM;wBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;yBACrC,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM;wBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC9E,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC;oBACT,EAAE,EAAE,KAAK,CAAC,MAAM;oBAChB,QAAQ;oBACR,gBAAgB,EAAE,GAAG,CAAC,IAAI,EAAE;oBAC5B,gBAAgB,EAAE,GAAG,CAAC,IAAI,EAAE;iBAC7B,CAAC,CAAC;YACL,CAAC;YACD,OAAO;QACT,CAAC;QACD,6BAA6B;QAC7B,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACjB,0BAA0B;QAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,CAAC;YAAE,OAAO;QACf,2DAA2D;QAC3D,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACtB,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAE,OAAO,CAAC,OAAO;QAC5C,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACrD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAA,kBAAU,EAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAAE,OAAO;QAC7C,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACf,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACjB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IAED,SAAS,CAAC,CAAC,CAAC,CAAC;IACb,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+EAA+E;AAE/E,yEAAyE;AACzE,qDAAqD;AACrD,EAAE;AACF,2EAA2E;AAC3E,uEAAuE;AACvE,yEAAyE;AACzE,2BAA2B;AAC3B,SAAgB,WAAW,CAAC,KAAa;IACvC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,wCAAwC;QACxC,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,EAAE,CAAC;gBACnB,eAAe,CAAC,IAAI,CAAC,IAAA,kBAAU,EAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,EAAE,GAAG,IAAI,CAAC;YACd,KAAK,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;gBAClC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACzB,EAAE,GAAG,KAAK,CAAC;oBACX,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,EAAE;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC1B,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAcD,SAAgB,eAAe,CAAC,IAAU;IACxC,MAAM,EAAE,GAAkB,EAAE,CAAC;IAC7B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QACnC,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,EAAE,CAAC;YACnB,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,iBAAiB,EAAE,IAAA,kBAAU,EAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5D,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,EAAE,CAAC;YAC1B,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,iBAAiB,EAAE,IAAA,kBAAU,EAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,SAAgB,YAAY,CAAC,CAAO;IAClC,MAAM,GAAG,GAAG,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzC,MAAM,GAAG,GAAG,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7D,MAAM,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7D,OAAO,GAAG,IAAI,GAAG,CAAC;AACpB,CAAC;AAED,SAAgB,eAAe,CAAC,CAAa;IAC3C,OAAO,IAAA,uBAAe,EAAC,CAAC,CAAC,CAAC;AAC5B,CAAC"}

package/dist/profiles/ltl-sat/types.d.ts

@@ -0,0 +1,52 @@
+export type LTLFormula = {
+    kind: 'atom';
+    name: string;
+} | {
+    kind: 'not';
+    arg: LTLFormula;
+} | {
+    kind: 'and';
+    args: LTLFormula[];
+} | {
+    kind: 'or';
+    args: LTLFormula[];
+} | {
+    kind: 'X';
+    arg: LTLFormula;
+} | {
+    kind: 'F';
+    arg: LTLFormula;
+} | {
+    kind: 'G';
+    arg: LTLFormula;
+} | {
+    kind: 'U';
+    left: LTLFormula;
+    right: LTLFormula;
+} | {
+    kind: 'R';
+    left: LTLFormula;
+    right: LTLFormula;
+};
+export declare const atom: (name: string) => LTLFormula;
+export declare const not: (arg: LTLFormula) => LTLFormula;
+export declare const and: (...args: LTLFormula[]) => LTLFormula;
+export declare const or: (...args: LTLFormula[]) => LTLFormula;
+export declare const next: (arg: LTLFormula) => LTLFormula;
+export declare const eventually: (arg: LTLFormula) => LTLFormula;
+export declare const globally: (arg: LTLFormula) => LTLFormula;
+export declare const until: (left: LTLFormula, right: LTLFormula) => LTLFormula;
+export declare const release: (left: LTLFormula, right: LTLFormula) => LTLFormula;
+export declare const weakUntil: (left: LTLFormula, right: LTLFormula) => LTLFormula;
+export declare const implies: (left: LTLFormula, right: LTLFormula) => LTLFormula;
+export interface Witness {
+    prefix: string[];
+    loop: string[];
+}
+export interface SatResult {
+    sat: boolean;
+    witness?: Witness;
+}
+export declare function formulaToString(f: LTLFormula): string;
+export declare function formulaKey(f: LTLFormula): string;
+//# sourceMappingURL=types.d.ts.map

package/dist/profiles/ltl-sat/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/profiles/ltl-sat/types.ts"],"names":[],"mappings":"AAWA,MAAM,MAAM,UAAU,GAClB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC9B;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,GAAG,EAAE,UAAU,CAAA;CAAE,GAChC;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,UAAU,EAAE,CAAA;CAAE,GACnC;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,UAAU,EAAE,CAAA;CAAE,GAClC;IAAE,IAAI,EAAE,GAAG,CAAC;IAAC,GAAG,EAAE,UAAU,CAAA;CAAE,GAC9B;IAAE,IAAI,EAAE,GAAG,CAAC;IAAC,GAAG,EAAE,UAAU,CAAA;CAAE,GAC9B;IAAE,IAAI,EAAE,GAAG,CAAC;IAAC,GAAG,EAAE,UAAU,CAAA;CAAE,GAC9B;IAAE,IAAI,EAAE,GAAG,CAAC;IAAC,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,GAClD;IAAE,IAAI,EAAE,GAAG,CAAC;IAAC,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,CAAC;AAGvD,eAAO,MAAM,IAAI,GAAI,MAAM,MAAM,KAAG,UAAsC,CAAC;AAC3E,eAAO,MAAM,GAAG,GAAI,KAAK,UAAU,KAAG,UAAoC,CAAC;AAC3E,eAAO,MAAM,GAAG,GAAI,GAAG,MAAM,UAAU,EAAE,KAAG,UAAqC,CAAC;AAClF,eAAO,MAAM,EAAE,GAAI,GAAG,MAAM,UAAU,EAAE,KAAG,UAAoC,CAAC;AAChF,eAAO,MAAM,IAAI,GAAI,KAAK,UAAU,KAAG,UAAkC,CAAC;AAC1E,eAAO,MAAM,UAAU,GAAI,KAAK,UAAU,KAAG,UAAkC,CAAC;AAChF,eAAO,MAAM,QAAQ,GAAI,KAAK,UAAU,KAAG,UAAkC,CAAC;AAC9E,eAAO,MAAM,KAAK,GAAI,MAAM,UAAU,EAAE,OAAO,UAAU,KAAG,UAI1D,CAAC;AACH,eAAO,MAAM,OAAO,GAAI,MAAM,UAAU,EAAE,OAAO,UAAU,KAAG,UAI5D,CAAC;AAEH,eAAO,MAAM,SAAS,GAAI,MAAM,UAAU,EAAE,OAAO,UAAU,KAAG,UACxB,CAAC;AAGzC,eAAO,MAAM,OAAO,GAAI,MAAM,UAAU,EAAE,OAAO,UAAU,KAAG,UAAkC,CAAC;AAEjG,MAAM,WAAW,OAAO;IACtB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AAED,MAAM,WAAW,SAAS;IACxB,GAAG,EAAE,OAAO,CAAC;IACb,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,UAAU,GAAG,MAAM,CAqBrD;AASD,wBAAgB,UAAU,CAAC,CAAC,EAAE,UAAU,GAAG,MAAM,CAqBhD"}