@stevenvo780/st-lang 4.1.0 → 4.3.0

package/dist/profiles/ctl/check.js

@@ -0,0 +1,359 @@
+"use strict";
+// ============================================================
+// CTL model checker — algoritmo clásico de labelling por punto fijo.
+// ============================================================
+// Complejidad O(|φ| · (|S| + |R|)) sobre modelos finitos.
+//
+// EX/AX: paso local sobre la relación R.
+// EF/AF: punto fijo mínimo (lfp).
+// EG/AG: punto fijo máximo (gfp).
+// EU:    punto fijo mínimo de E[A U B].
+// AU:    punto fijo mínimo de A[A U B]  (fórmula con sucesores universales).
+//
+// Reducciones equivalentes (no usadas en el camino principal por eficiencia
+// y claridad de witness):
+//   AX φ  ≡ ¬EX ¬φ
+//   AF φ  ≡ ¬EG ¬φ
+//   AG φ  ≡ ¬EF ¬φ
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.modelCheckCTL = modelCheckCTL;
+exports.satisfiesCTL = satisfiesCTL;
+function compile(M) {
+    const stateIds = M.states.map((s) => s.id);
+    const labelsByState = new Map();
+    const succ = new Map();
+    const pred = new Map();
+    for (const s of M.states) {
+        labelsByState.set(s.id, new Set(s.labels));
+        succ.set(s.id, new Set());
+        pred.set(s.id, new Set());
+    }
+    for (const [from, to] of M.transitions) {
+        if (!succ.has(from)) {
+            throw new Error(`CTL: transición desde estado desconocido "${from}"`);
+        }
+        if (!succ.has(to)) {
+            throw new Error(`CTL: transición hacia estado desconocido "${to}"`);
+        }
+        succ.get(from).add(to);
+        pred.get(to).add(from);
+    }
+    for (const init of M.initial) {
+        if (!labelsByState.has(init)) {
+            throw new Error(`CTL: estado inicial desconocido "${init}"`);
+        }
+    }
+    return { stateIds, labelsByState, succ, pred, initial: [...M.initial] };
+}
+function emptySat(model) {
+    const m = new Map();
+    for (const id of model.stateIds)
+        m.set(id, false);
+    return m;
+}
+function fullSat(model) {
+    const m = new Map();
+    for (const id of model.stateIds)
+        m.set(id, true);
+    return m;
+}
+function labelAtom(model, name) {
+    const sat = emptySat(model);
+    for (const id of model.stateIds) {
+        if (model.labelsByState.get(id).has(name))
+            sat.set(id, true);
+    }
+    return sat;
+}
+function labelNot(model, sub) {
+    const out = emptySat(model);
+    for (const id of model.stateIds)
+        out.set(id, !sub.get(id));
+    return out;
+}
+function labelAnd(model, subs) {
+    const out = fullSat(model);
+    for (const id of model.stateIds) {
+        let ok = true;
+        for (const s of subs) {
+            if (!s.get(id)) {
+                ok = false;
+                break;
+            }
+        }
+        out.set(id, ok);
+    }
+    return out;
+}
+function labelOr(model, subs) {
+    const out = emptySat(model);
+    for (const id of model.stateIds) {
+        let ok = false;
+        for (const s of subs) {
+            if (s.get(id)) {
+                ok = true;
+                break;
+            }
+        }
+        out.set(id, ok);
+    }
+    return out;
+}
+function labelEX(model, sub) {
+    const out = emptySat(model);
+    for (const id of model.stateIds) {
+        for (const s of model.succ.get(id)) {
+            if (sub.get(s)) {
+                out.set(id, true);
+                break;
+            }
+        }
+    }
+    return out;
+}
+function labelAX(model, sub) {
+    const out = emptySat(model);
+    for (const id of model.stateIds) {
+        const succs = model.succ.get(id);
+        let ok = true;
+        for (const s of succs) {
+            if (!sub.get(s)) {
+                ok = false;
+                break;
+            }
+        }
+        // Estado sin sucesores: AX φ trivialmente true.
+        out.set(id, ok);
+    }
+    return out;
+}
+/** EF φ = μZ. φ ∨ EX Z  (lfp). */
+function labelEF(model, sub) {
+    const z = emptySat(model);
+    for (const id of model.stateIds)
+        if (sub.get(id))
+            z.set(id, true);
+    const queue = [];
+    for (const id of model.stateIds)
+        if (z.get(id))
+            queue.push(id);
+    while (queue.length > 0) {
+        const cur = queue.shift();
+        for (const p of model.pred.get(cur)) {
+            if (!z.get(p)) {
+                z.set(p, true);
+                queue.push(p);
+            }
+        }
+    }
+    return z;
+}
+/** AF φ = μZ. φ ∨ AX Z  (lfp). */
+function labelAF(model, sub) {
+    const z = emptySat(model);
+    for (const id of model.stateIds)
+        if (sub.get(id))
+            z.set(id, true);
+    let changed = true;
+    while (changed) {
+        changed = false;
+        for (const id of model.stateIds) {
+            if (z.get(id))
+                continue;
+            const succs = model.succ.get(id);
+            if (succs.size === 0)
+                continue; // deadlock sin φ: nunca llegará a φ
+            let all = true;
+            for (const s of succs) {
+                if (!z.get(s)) {
+                    all = false;
+                    break;
+                }
+            }
+            if (all) {
+                z.set(id, true);
+                changed = true;
+            }
+        }
+    }
+    return z;
+}
+/** EG φ = νZ. φ ∧ EX Z  (gfp). */
+function labelEG(model, sub) {
+    const z = emptySat(model);
+    for (const id of model.stateIds)
+        if (sub.get(id))
+            z.set(id, true);
+    let changed = true;
+    while (changed) {
+        changed = false;
+        for (const id of model.stateIds) {
+            if (!z.get(id))
+                continue;
+            const succs = model.succ.get(id);
+            let hasSucc = false;
+            for (const s of succs) {
+                if (z.get(s)) {
+                    hasSucc = true;
+                    break;
+                }
+            }
+            if (!hasSucc) {
+                z.set(id, false);
+                changed = true;
+            }
+        }
+    }
+    return z;
+}
+/** AG φ = νZ. φ ∧ AX Z  (gfp). */
+function labelAG(model, sub) {
+    const z = emptySat(model);
+    for (const id of model.stateIds)
+        if (sub.get(id))
+            z.set(id, true);
+    let changed = true;
+    while (changed) {
+        changed = false;
+        for (const id of model.stateIds) {
+            if (!z.get(id))
+                continue;
+            const succs = model.succ.get(id);
+            let allOk = true;
+            for (const s of succs) {
+                if (!z.get(s)) {
+                    allOk = false;
+                    break;
+                }
+            }
+            // Estado sin sucesores: AX trivialmente true, mantiene Z.
+            if (!allOk) {
+                z.set(id, false);
+                changed = true;
+            }
+        }
+    }
+    return z;
+}
+/** E[A U B] = μZ. B ∨ (A ∧ EX Z)  (lfp). */
+function labelEU(model, subA, subB) {
+    const z = emptySat(model);
+    for (const id of model.stateIds)
+        if (subB.get(id))
+            z.set(id, true);
+    const queue = [];
+    for (const id of model.stateIds)
+        if (z.get(id))
+            queue.push(id);
+    while (queue.length > 0) {
+        const cur = queue.shift();
+        for (const p of model.pred.get(cur)) {
+            if (z.get(p))
+                continue;
+            if (subA.get(p)) {
+                z.set(p, true);
+                queue.push(p);
+            }
+        }
+    }
+    return z;
+}
+/** A[A U B] = μZ. B ∨ (A ∧ AX Z ∧ EX Z)  (lfp).
+ *  El EX Z extra evita que estados sin sucesores satisfagan A[A U B]
+ *  cuando aún no hemos visto B — un deadlock no garantiza llegar a B.
+ */
+function labelAU(model, subA, subB) {
+    const z = emptySat(model);
+    for (const id of model.stateIds)
+        if (subB.get(id))
+            z.set(id, true);
+    let changed = true;
+    while (changed) {
+        changed = false;
+        for (const id of model.stateIds) {
+            if (z.get(id))
+                continue;
+            if (!subA.get(id))
+                continue;
+            const succs = model.succ.get(id);
+            if (succs.size === 0)
+                continue;
+            let allOk = true;
+            for (const s of succs) {
+                if (!z.get(s)) {
+                    allOk = false;
+                    break;
+                }
+            }
+            if (allOk) {
+                z.set(id, true);
+                changed = true;
+            }
+        }
+    }
+    return z;
+}
+function label(model, phi) {
+    switch (phi.kind) {
+        case 'true':
+            return fullSat(model);
+        case 'false':
+            return emptySat(model);
+        case 'atom':
+            return labelAtom(model, phi.name);
+        case 'not':
+            return labelNot(model, label(model, phi.arg));
+        case 'and':
+            return labelAnd(model, phi.args.map((a) => label(model, a)));
+        case 'or':
+            return labelOr(model, phi.args.map((a) => label(model, a)));
+        case 'implies': {
+            const l = label(model, phi.left);
+            const r = label(model, phi.right);
+            const out = emptySat(model);
+            for (const id of model.stateIds) {
+                out.set(id, !l.get(id) || !!r.get(id));
+            }
+            return out;
+        }
+        case 'EX':
+            return labelEX(model, label(model, phi.arg));
+        case 'AX':
+            return labelAX(model, label(model, phi.arg));
+        case 'EF':
+            return labelEF(model, label(model, phi.arg));
+        case 'AF':
+            return labelAF(model, label(model, phi.arg));
+        case 'EG':
+            return labelEG(model, label(model, phi.arg));
+        case 'AG':
+            return labelAG(model, label(model, phi.arg));
+        case 'EU':
+            return labelEU(model, label(model, phi.left), label(model, phi.right));
+        case 'AU':
+            return labelAU(model, label(model, phi.left), label(model, phi.right));
+    }
+}
+/**
+ * Model checking de Computation Tree Logic.
+ * Devuelve un mapa `stateId → φ se cumple en ese estado`.
+ */
+function modelCheckCTL(M, phi) {
+    const model = compile(M);
+    return label(model, phi);
+}
+/**
+ * `M ⊨ φ` cuando φ se cumple en todos los estados iniciales.
+ * Si `initial` está vacío, devuelve `true` por vacuidad (consistente con
+ * la lectura "no hay contraejemplo en S0").
+ */
+function satisfiesCTL(M, phi) {
+    const sat = modelCheckCTL(M, phi);
+    for (const id of M.initial) {
+        if (!sat.get(id))
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=check.js.map

package/dist/profiles/ctl/check.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"check.js","sourceRoot":"","sources":["../../../src/profiles/ctl/check.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qEAAqE;AACrE,+DAA+D;AAC/D,0DAA0D;AAC1D,EAAE;AACF,yCAAyC;AACzC,kCAAkC;AAClC,kCAAkC;AAClC,wCAAwC;AACxC,6EAA6E;AAC7E,EAAE;AACF,4EAA4E;AAC5E,0BAA0B;AAC1B,mBAAmB;AACnB,mBAAmB;AACnB,mBAAmB;AACnB,+DAA+D;;AAwU/D,sCAGC;AAOD,oCAMC;AA1UD,SAAS,OAAO,CAAC,CAAkB;IACjC,MAAM,QAAQ,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAC;IACrD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QACzB,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAC3C,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC1B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAC5B,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;QACvC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,6CAA6C,IAAI,GAAG,CAAC,CAAC;QACxE,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,6CAA6C,EAAE,GAAG,CAAC,CAAC;QACtE,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QAC7B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,oCAAoC,IAAI,GAAG,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;AAC1E,CAAC;AAED,SAAS,QAAQ,CAAC,KAAoB;IACpC,MAAM,CAAC,GAAG,IAAI,GAAG,EAAmB,CAAC;IACrC,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ;QAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAClD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,OAAO,CAAC,KAAoB;IACnC,MAAM,CAAC,GAAG,IAAI,GAAG,EAAmB,CAAC;IACrC,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ;QAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACjD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,SAAS,CAAC,KAAoB,EAAE,IAAY;IACnD,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAChE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,QAAQ,CAAC,KAAoB,EAAE,GAAW;IACjD,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ;QAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3D,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,QAAQ,CAAC,KAAoB,EAAE,IAAc;IACpD,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IAC3B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QAChC,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACf,EAAE,GAAG,KAAK,CAAC;gBACX,MAAM;YACR,CAAC;QACH,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,OAAO,CAAC,KAAoB,EAAE,IAAc;IACnD,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QAChC,IAAI,EAAE,GAAG,KAAK,CAAC;QACf,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACd,EAAE,GAAG,IAAI,CAAC;gBACV,MAAM;YACR,CAAC;QACH,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,OAAO,CAAC,KAAoB,EAAE,GAAW;IAChD,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QAChC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,CAAC;YACpC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACf,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBAClB,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,OAAO,CAAC,KAAoB,EAAE,GAAW;IAChD,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QAChC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAClC,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChB,EAAE,GAAG,KAAK,CAAC;gBACX,MAAM;YACR,CAAC;QACH,CAAC;QACD,gDAAgD;QAChD,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,kCAAkC;AAClC,SAAS,OAAO,CAAC,KAAoB,EAAE,GAAW;IAChD,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC1B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ;QAAE,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAClE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/D,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAE,EAAE,CAAC;YACrC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACd,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,kCAAkC;AAClC,SAAS,OAAO,CAAC,KAAoB,EAAE,GAAW;IAChD,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC1B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ;QAAE,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAClE,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAChC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YACxB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAClC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;gBAAE,SAAS,CAAC,oCAAoC;YACpE,IAAI,GAAG,GAAG,IAAI,CAAC;YACf,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACd,GAAG,GAAG,KAAK,CAAC;oBACZ,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,GAAG,EAAE,CAAC;gBACR,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBAChB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,kCAAkC;AAClC,SAAS,OAAO,CAAC,KAAoB,EAAE,GAAW;IAChD,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC1B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ;QAAE,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAClE,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAChC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YACzB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAClC,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACb,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBACjB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,kCAAkC;AAClC,SAAS,OAAO,CAAC,KAAoB,EAAE,GAAW;IAChD,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC1B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ;QAAE,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAClE,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAChC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YACzB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAClC,IAAI,KAAK,GAAG,IAAI,CAAC;YACjB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACd,KAAK,GAAG,KAAK,CAAC;oBACd,MAAM;gBACR,CAAC;YACH,CAAC;YACD,0DAA0D;YAC1D,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBACjB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,4CAA4C;AAC5C,SAAS,OAAO,CAAC,KAAoB,EAAE,IAAY,EAAE,IAAY;IAC/D,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC1B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ;QAAE,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACnE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/D,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAE,EAAE,CAAC;YACrC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YACvB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChB,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;GAGG;AACH,SAAS,OAAO,CAAC,KAAoB,EAAE,IAAY,EAAE,IAAY;IAC/D,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC1B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ;QAAE,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACnE,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAChC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YACxB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAClC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;gBAAE,SAAS;YAC/B,IAAI,KAAK,GAAG,IAAI,CAAC;YACjB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACd,KAAK,GAAG,KAAK,CAAC;oBACd,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,KAAK,EAAE,CAAC;gBACV,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBAChB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,KAAK,CAAC,KAAoB,EAAE,GAAe;IAClD,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,MAAM;YACT,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;QACxB,KAAK,OAAO;YACV,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC;QACzB,KAAK,MAAM;YACT,OAAO,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;QACpC,KAAK,KAAK;YACR,OAAO,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,KAAK,KAAK;YACR,OAAO,QAAQ,CACb,KAAK,EACL,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CACrC,CAAC;QACJ,KAAK,IAAI;YACP,OAAO,OAAO,CACZ,KAAK,EACL,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CACrC,CAAC;QACJ,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC5B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAChC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACzC,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,IAAI;YACP,OAAO,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,KAAK,IAAI;YACP,OAAO,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,KAAK,IAAI;YACP,OAAO,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,KAAK,IAAI;YACP,OAAO,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,KAAK,IAAI;YACP,OAAO,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,KAAK,IAAI;YACP,OAAO,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,KAAK,IAAI;YACP,OAAO,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QACzE,KAAK,IAAI;YACP,OAAO,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IAC3E,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAgB,aAAa,CAAC,CAAkB,EAAE,GAAe;IAC/D,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAC3B,CAAC;AAED;;;;GAIG;AACH,SAAgB,YAAY,CAAC,CAAkB,EAAE,GAAe;IAC9D,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAClC,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;IACjC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/profiles/ctl/index.d.ts

@@ -0,0 +1,5 @@
+export type { CTLFormula, KripkeState, KripkeStructure } from './types';
+export { ctlToString } from './types';
+export { modelCheckCTL, satisfiesCTL } from './check';
+export { generateWitness } from './witness';
+//# sourceMappingURL=index.d.ts.map

package/dist/profiles/ctl/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/profiles/ctl/index.ts"],"names":[],"mappings":"AAaA,YAAY,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC;AACxE,OAAO,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AACtC,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC"}

package/dist/profiles/ctl/index.js

@@ -0,0 +1,23 @@
+"use strict";
+// ============================================================
+// ST CTL — punto de entrada público del perfil.
+// ============================================================
+// API:
+//   modelCheckCTL(M, φ)   → Map<stateId, holds>
+//   satisfiesCTL(M, φ)    → boolean (φ vale en todos los iniciales)
+//   generateWitness(M, φ, state) → string[] | null
+//   ctlToString(φ)        → notación textual
+//
+// La estructura de Kripke se asume finita. El algoritmo de labelling es
+// O(|φ| · (|S| + |R|)).
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.generateWitness = exports.satisfiesCTL = exports.modelCheckCTL = exports.ctlToString = void 0;
+var types_1 = require("./types");
+Object.defineProperty(exports, "ctlToString", { enumerable: true, get: function () { return types_1.ctlToString; } });
+var check_1 = require("./check");
+Object.defineProperty(exports, "modelCheckCTL", { enumerable: true, get: function () { return check_1.modelCheckCTL; } });
+Object.defineProperty(exports, "satisfiesCTL", { enumerable: true, get: function () { return check_1.satisfiesCTL; } });
+var witness_1 = require("./witness");
+Object.defineProperty(exports, "generateWitness", { enumerable: true, get: function () { return witness_1.generateWitness; } });
+//# sourceMappingURL=index.js.map

package/dist/profiles/ctl/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/profiles/ctl/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gDAAgD;AAChD,+DAA+D;AAC/D,OAAO;AACP,gDAAgD;AAChD,oEAAoE;AACpE,mDAAmD;AACnD,6CAA6C;AAC7C,EAAE;AACF,wEAAwE;AACxE,wBAAwB;AACxB,+DAA+D;;;AAG/D,iCAAsC;AAA7B,oGAAA,WAAW,OAAA;AACpB,iCAAsD;AAA7C,sGAAA,aAAa,OAAA;AAAE,qGAAA,YAAY,OAAA;AACpC,qCAA4C;AAAnC,0GAAA,eAAe,OAAA"}

package/dist/profiles/ctl/types.d.ts

@@ -0,0 +1,74 @@
+/**
+ * Estado de una estructura de Kripke.
+ *  - `id`     identificador único del estado.
+ *  - `labels` proposiciones atómicas que se cumplen en el estado.
+ */
+export interface KripkeState {
+    id: string;
+    labels: Set<string>;
+}
+/**
+ * Estructura de Kripke: M = (S, R, L, S0).
+ *  - `states`      conjunto de estados con sus etiquetas.
+ *  - `transitions` relación R ⊆ S × S codificada como pares [from, to].
+ *  - `initial`     subconjunto de estados iniciales (S0).
+ */
+export interface KripkeStructure {
+    states: KripkeState[];
+    transitions: Array<[string, string]>;
+    initial: string[];
+}
+/**
+ * AST de Computation Tree Logic. Cubre los 8 operadores temporales
+ * estándar: EX/AX, EF/AF, EG/AG, EU/AU.
+ */
+export type CTLFormula = {
+    kind: 'atom';
+    name: string;
+} | {
+    kind: 'true';
+} | {
+    kind: 'false';
+} | {
+    kind: 'not';
+    arg: CTLFormula;
+} | {
+    kind: 'and';
+    args: CTLFormula[];
+} | {
+    kind: 'or';
+    args: CTLFormula[];
+} | {
+    kind: 'implies';
+    left: CTLFormula;
+    right: CTLFormula;
+} | {
+    kind: 'EX';
+    arg: CTLFormula;
+} | {
+    kind: 'AX';
+    arg: CTLFormula;
+} | {
+    kind: 'EF';
+    arg: CTLFormula;
+} | {
+    kind: 'AF';
+    arg: CTLFormula;
+} | {
+    kind: 'EG';
+    arg: CTLFormula;
+} | {
+    kind: 'AG';
+    arg: CTLFormula;
+} | {
+    kind: 'EU';
+    left: CTLFormula;
+    right: CTLFormula;
+} | {
+    kind: 'AU';
+    left: CTLFormula;
+    right: CTLFormula;
+};
+/** Renderiza una fórmula CTL a notación textual estándar. */
+export declare function ctlToString(f: CTLFormula): string;
+//# sourceMappingURL=types.d.ts.map

package/dist/profiles/ctl/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/profiles/ctl/types.ts"],"names":[],"mappings":"AAeA;;;;GAIG;AACH,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CACrB;AAED;;;;;GAKG;AACH,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,WAAW,EAAE,CAAC;IACtB,WAAW,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACrC,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED;;;GAGG;AACH,MAAM,MAAM,UAAU,GAClB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC9B;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAChB;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE,GACjB;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,SAAS,CAAC;IAAC,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,GACxD;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,GAAG,EAAE,UAAU,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,GAAG,EAAE,UAAU,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,GAAG,EAAE,UAAU,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,GAAG,EAAE,UAAU,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,GAAG,EAAE,UAAU,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,GAAG,EAAE,UAAU,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,GACnD;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,CAAC;AAExD,6DAA6D;AAC7D,wBAAgB,WAAW,CAAC,CAAC,EAAE,UAAU,GAAG,MAAM,CAiCjD"}

package/dist/profiles/ctl/types.js

@@ -0,0 +1,53 @@
+"use strict";
+// ============================================================
+// ST CTL — Computation Tree Logic
+// ============================================================
+// Estructuras de Kripke y AST de fórmulas CTL.
+//
+// Convenciones:
+//  - Operadores de camino "exists" (E) requieren al menos UN camino
+//    desde el estado actual que cumpla la propiedad temporal.
+//  - Operadores de camino "all" (A) requieren que TODOS los caminos
+//    desde el estado actual cumplan la propiedad temporal.
+//  - Estados sin sucesores se consideran "deadlock": AX φ es trivialmente
+//    verdadero, EX φ es trivialmente falso.
+//  - El modelo se asume finito. EG y EU se resuelven con punto fijo.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ctlToString = ctlToString;
+/** Renderiza una fórmula CTL a notación textual estándar. */
+function ctlToString(f) {
+    switch (f.kind) {
+        case 'atom':
+            return f.name;
+        case 'true':
+            return '⊤';
+        case 'false':
+            return '⊥';
+        case 'not':
+            return `¬${ctlToString(f.arg)}`;
+        case 'and':
+            return `(${f.args.map(ctlToString).join(' ∧ ')})`;
+        case 'or':
+            return `(${f.args.map(ctlToString).join(' ∨ ')})`;
+        case 'implies':
+            return `(${ctlToString(f.left)} → ${ctlToString(f.right)})`;
+        case 'EX':
+            return `EX ${ctlToString(f.arg)}`;
+        case 'AX':
+            return `AX ${ctlToString(f.arg)}`;
+        case 'EF':
+            return `EF ${ctlToString(f.arg)}`;
+        case 'AF':
+            return `AF ${ctlToString(f.arg)}`;
+        case 'EG':
+            return `EG ${ctlToString(f.arg)}`;
+        case 'AG':
+            return `AG ${ctlToString(f.arg)}`;
+        case 'EU':
+            return `E[${ctlToString(f.left)} U ${ctlToString(f.right)}]`;
+        case 'AU':
+            return `A[${ctlToString(f.left)} U ${ctlToString(f.right)}]`;
+    }
+}
+//# sourceMappingURL=types.js.map

package/dist/profiles/ctl/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/profiles/ctl/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,kCAAkC;AAClC,+DAA+D;AAC/D,+CAA+C;AAC/C,EAAE;AACF,gBAAgB;AAChB,oEAAoE;AACpE,8DAA8D;AAC9D,oEAAoE;AACpE,2DAA2D;AAC3D,0EAA0E;AAC1E,4CAA4C;AAC5C,qEAAqE;AACrE,+DAA+D;;AA8C/D,kCAiCC;AAlCD,6DAA6D;AAC7D,SAAgB,WAAW,CAAC,CAAa;IACvC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,MAAM;YACT,OAAO,GAAG,CAAC;QACb,KAAK,OAAO;YACV,OAAO,GAAG,CAAC;QACb,KAAK,KAAK;YACR,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,KAAK,KAAK;YACR,OAAO,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QACpD,KAAK,IAAI;YACP,OAAO,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QACpD,KAAK,SAAS;YACZ,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QAC9D,KAAK,IAAI;YACP,OAAO,MAAM,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACpC,KAAK,IAAI;YACP,OAAO,MAAM,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACpC,KAAK,IAAI;YACP,OAAO,MAAM,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACpC,KAAK,IAAI;YACP,OAAO,MAAM,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACpC,KAAK,IAAI;YACP,OAAO,MAAM,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACpC,KAAK,IAAI;YACP,OAAO,MAAM,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACpC,KAAK,IAAI;YACP,OAAO,KAAK,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QAC/D,KAAK,IAAI;YACP,OAAO,KAAK,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;IACjE,CAAC;AACH,CAAC"}

package/dist/profiles/ctl/witness.d.ts

@@ -0,0 +1,20 @@
+import type { CTLFormula, KripkeStructure } from './types';
+/**
+ * Encuentra un camino testigo finito (`stateId[]`) que justifique
+ * que `phi` se cumple en `state`. Devuelve `null` si:
+ *  - `phi` no se cumple en `state`, o
+ *  - `phi` es universal (AX/AF/AG/AU) — no admite un único witness path, o
+ *  - `state` no existe en el modelo.
+ *
+ * Convenciones del path devuelto:
+ *  - EX φ        → `[state, next]` con `next ⊨ φ`.
+ *  - EF φ        → camino más corto desde `state` hasta un estado con `φ`.
+ *  - EG φ        → camino que entra en un ciclo de estados con `φ`;
+ *                  el último elemento del camino aparece dos veces para
+ *                  marcar el lazo (lasso witness).
+ *  - E[A U B]    → camino donde todos los intermedios cumplen A y el
+ *                  último cumple B.
+ *  - cualquier otro operador no existencial → `null`.
+ */
+export declare function generateWitness(M: KripkeStructure, phi: CTLFormula, state: string): string[] | null;
+//# sourceMappingURL=witness.d.ts.map

package/dist/profiles/ctl/witness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"witness.d.ts","sourceRoot":"","sources":["../../../src/profiles/ctl/witness.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC;AAuD3D;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,eAAe,CAC7B,CAAC,EAAE,eAAe,EAClB,GAAG,EAAE,UAAU,EACf,KAAK,EAAE,MAAM,GACZ,MAAM,EAAE,GAAG,IAAI,CAuDjB"}