@stevenvo780/st-lang 4.14.1 → 4.15.0

package/dist/logic/profiles/dl-hybrid/semantics.js

@@ -0,0 +1,181 @@
+"use strict";
+// ============================================================
+// ST dL-Hybrid — Semántica concreta (interpretación de términos y fórmulas)
+// ============================================================
+// Funciones puras que dan significado a términos y fórmulas dL sobre un
+// estado concreto `State = Map<varName, value: number>`. Esta capa NO
+// decide validez universal; sólo evalúa con valores concretos. La capa
+// `tableau.ts` la usa para chequear contramodelos y propagar estados a
+// través de programas híbridos.
+//
+// Convenciones:
+//   • División por cero → NaN (la comparación con NaN cae al lado false).
+//   • Comparación = sobre flotantes usa tolerancia EPS = 1e-9.
+//   • Una variable no presente en el estado se interpreta como 0.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.evalTerm = evalTerm;
+exports.evalComp = evalComp;
+exports.evalQuantifierFree = evalQuantifierFree;
+exports.substTerm = substTerm;
+exports.substFormula = substFormula;
+const EPS = 1e-9;
+/** Evalúa un término sobre un estado concreto. */
+function evalTerm(t, s) {
+    switch (t.kind) {
+        case 'num':
+            return t.value;
+        case 'var':
+            return s.get(t.name) ?? 0;
+        case 'plus':
+            return evalTerm(t.left, s) + evalTerm(t.right, s);
+        case 'minus':
+            return evalTerm(t.left, s) - evalTerm(t.right, s);
+        case 'times':
+            return evalTerm(t.left, s) * evalTerm(t.right, s);
+        case 'div': {
+            const den = evalTerm(t.right, s);
+            if (Math.abs(den) < EPS)
+                return NaN;
+            return evalTerm(t.left, s) / den;
+        }
+        case 'neg':
+            return -evalTerm(t.arg, s);
+        case 'pow': {
+            const b = evalTerm(t.base, s);
+            return Math.pow(b, t.exp);
+        }
+    }
+}
+/** Evalúa una comparación con tolerancia. */
+function evalComp(op, a, b) {
+    if (Number.isNaN(a) || Number.isNaN(b))
+        return false;
+    switch (op) {
+        case '=':
+            return Math.abs(a - b) < EPS;
+        case '!=':
+            return Math.abs(a - b) >= EPS;
+        case '<':
+            return a < b - EPS;
+        case '<=':
+            return a <= b + EPS;
+        case '>':
+            return a > b + EPS;
+        case '>=':
+            return a >= b - EPS;
+    }
+}
+/**
+ * Evalúa una fórmula proposicional / aritmética (sin modalidades) sobre
+ * un estado concreto. Para fórmulas con [α]/⟨α⟩ se requiere el motor de
+ * tableau (`tableau.ts`).
+ */
+function evalQuantifierFree(f, s) {
+    switch (f.kind) {
+        case 'true':
+            return true;
+        case 'false':
+            return false;
+        case 'comp':
+            return evalComp(f.op, evalTerm(f.left, s), evalTerm(f.right, s));
+        case 'not':
+            return !evalQuantifierFree(f.arg, s);
+        case 'and':
+            return evalQuantifierFree(f.left, s) && evalQuantifierFree(f.right, s);
+        case 'or':
+            return evalQuantifierFree(f.left, s) || evalQuantifierFree(f.right, s);
+        case 'implies':
+            return !evalQuantifierFree(f.left, s) || evalQuantifierFree(f.right, s);
+        case 'iff':
+            return evalQuantifierFree(f.left, s) === evalQuantifierFree(f.right, s);
+        case 'box':
+        case 'diamond':
+            throw new Error('evalQuantifierFree no maneja modalidades; usar tableau.');
+    }
+}
+/** Substitución de un término por otro dentro de un término. */
+function substTerm(t, varName, replacement) {
+    switch (t.kind) {
+        case 'num':
+            return t;
+        case 'var':
+            return t.name === varName ? replacement : t;
+        case 'plus':
+            return {
+                kind: 'plus',
+                left: substTerm(t.left, varName, replacement),
+                right: substTerm(t.right, varName, replacement),
+            };
+        case 'minus':
+            return {
+                kind: 'minus',
+                left: substTerm(t.left, varName, replacement),
+                right: substTerm(t.right, varName, replacement),
+            };
+        case 'times':
+            return {
+                kind: 'times',
+                left: substTerm(t.left, varName, replacement),
+                right: substTerm(t.right, varName, replacement),
+            };
+        case 'div':
+            return {
+                kind: 'div',
+                left: substTerm(t.left, varName, replacement),
+                right: substTerm(t.right, varName, replacement),
+            };
+        case 'neg':
+            return { kind: 'neg', arg: substTerm(t.arg, varName, replacement) };
+        case 'pow':
+            return { kind: 'pow', base: substTerm(t.base, varName, replacement), exp: t.exp };
+    }
+}
+/** Substitución dentro de una fórmula (sólo a través de comparaciones). */
+function substFormula(f, varName, replacement) {
+    switch (f.kind) {
+        case 'true':
+        case 'false':
+            return f;
+        case 'comp':
+            return {
+                kind: 'comp',
+                op: f.op,
+                left: substTerm(f.left, varName, replacement),
+                right: substTerm(f.right, varName, replacement),
+            };
+        case 'not':
+            return { kind: 'not', arg: substFormula(f.arg, varName, replacement) };
+        case 'and':
+            return {
+                kind: 'and',
+                left: substFormula(f.left, varName, replacement),
+                right: substFormula(f.right, varName, replacement),
+            };
+        case 'or':
+            return {
+                kind: 'or',
+                left: substFormula(f.left, varName, replacement),
+                right: substFormula(f.right, varName, replacement),
+            };
+        case 'implies':
+            return {
+                kind: 'implies',
+                left: substFormula(f.left, varName, replacement),
+                right: substFormula(f.right, varName, replacement),
+            };
+        case 'iff':
+            return {
+                kind: 'iff',
+                left: substFormula(f.left, varName, replacement),
+                right: substFormula(f.right, varName, replacement),
+            };
+        case 'box':
+        case 'diamond':
+            // No se hace alfa-renaming: si la variable es modificada dentro del
+            // programa la substitución podría capturar; el tableau se encarga
+            // de no introducir estas situaciones (asigna desde el estado actual).
+            return f;
+    }
+}
+//# sourceMappingURL=semantics.js.map

package/dist/logic/profiles/dl-hybrid/semantics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantics.js","sourceRoot":"","sources":["../../../../src/logic/profiles/dl-hybrid/semantics.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4EAA4E;AAC5E,+DAA+D;AAC/D,wEAAwE;AACxE,sEAAsE;AACtE,uEAAuE;AACvE,uEAAuE;AACvE,gCAAgC;AAChC,EAAE;AACF,gBAAgB;AAChB,0EAA0E;AAC1E,+DAA+D;AAC/D,kEAAkE;AAClE,+DAA+D;;AAO/D,4BAwBC;AAGD,4BAgBC;AAOD,gDAsBC;AAGD,8BAmCC;AAGD,oCA6CC;AAjKD,MAAM,GAAG,GAAG,IAAI,CAAC;AAEjB,kDAAkD;AAClD,SAAgB,QAAQ,CAAC,CAAS,EAAE,CAAQ;IAC1C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,CAAC,CAAC,KAAK,CAAC;QACjB,KAAK,KAAK;YACR,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,KAAK,MAAM;YACT,OAAO,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACpD,KAAK,OAAO;YACV,OAAO,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACpD,KAAK,OAAO;YACV,OAAO,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACpD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACjC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG;gBAAE,OAAO,GAAG,CAAC;YACpC,OAAO,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC;QACnC,CAAC;QACD,KAAK,KAAK;YACR,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC7B,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC9B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;AACH,CAAC;AAED,6CAA6C;AAC7C,SAAgB,QAAQ,CAAC,EAAU,EAAE,CAAS,EAAE,CAAS;IACvD,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACrD,QAAQ,EAAE,EAAE,CAAC;QACX,KAAK,GAAG;YACN,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;QAC/B,KAAK,IAAI;YACP,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC;QAChC,KAAK,GAAG;YACN,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;QACrB,KAAK,IAAI;YACP,OAAO,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;QACtB,KAAK,GAAG;YACN,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;QACrB,KAAK,IAAI;YACP,OAAO,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;IACxB,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAgB,kBAAkB,CAAC,CAAY,EAAE,CAAQ;IACvD,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,IAAI,CAAC;QACd,KAAK,OAAO;YACV,OAAO,KAAK,CAAC;QACf,KAAK,MAAM;YACT,OAAO,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QACnE,KAAK,KAAK;YACR,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvC,KAAK,KAAK;YACR,OAAO,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,kBAAkB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACzE,KAAK,IAAI;YACP,OAAO,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,kBAAkB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACzE,KAAK,SAAS;YACZ,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,kBAAkB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1E,KAAK,KAAK;YACR,OAAO,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,kBAAkB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1E,KAAK,KAAK,CAAC;QACX,KAAK,SAAS;YACZ,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,CAAC;IAC/E,CAAC;AACH,CAAC;AAED,gEAAgE;AAChE,SAAgB,SAAS,CAAC,CAAS,EAAE,OAAe,EAAE,WAAmB;IACvE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,CAAC,CAAC;QACX,KAAK,KAAK;YACR,OAAO,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,KAAK,MAAM;YACT,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC;gBAC7C,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC;aAChD,CAAC;QACJ,KAAK,OAAO;YACV,OAAO;gBACL,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC;gBAC7C,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC;aAChD,CAAC;QACJ,KAAK,OAAO;YACV,OAAO;gBACL,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC;gBAC7C,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC;aAChD,CAAC;QACJ,KAAK,KAAK;YACR,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC;gBAC7C,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC;aAChD,CAAC;QACJ,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,EAAE,CAAC;QACtE,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;IACtF,CAAC;AACH,CAAC;AAED,2EAA2E;AAC3E,SAAgB,YAAY,CAAC,CAAY,EAAE,OAAe,EAAE,WAAmB;IAC7E,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM,CAAC;QACZ,KAAK,OAAO;YACV,OAAO,CAAC,CAAC;QACX,KAAK,MAAM;YACT,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC;gBAC7C,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC;aAChD,CAAC;QACJ,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,EAAE,CAAC;QACzE,KAAK,KAAK;YACR,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC;gBAChD,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC;aACnD,CAAC;QACJ,KAAK,IAAI;YACP,OAAO;gBACL,IAAI,EAAE,IAAI;gBACV,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC;gBAChD,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC;aACnD,CAAC;QACJ,KAAK,SAAS;YACZ,OAAO;gBACL,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC;gBAChD,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC;aACnD,CAAC;QACJ,KAAK,KAAK;YACR,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC;gBAChD,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC;aACnD,CAAC;QACJ,KAAK,KAAK,CAAC;QACX,KAAK,SAAS;YACZ,oEAAoE;YACpE,kEAAkE;YAClE,sEAAsE;YACtE,OAAO,CAAC,CAAC;IACb,CAAC;AACH,CAAC"}

package/dist/logic/profiles/dl-hybrid/tableau.d.ts

@@ -0,0 +1,38 @@
+import type { DLFormula, State } from './ast';
+export interface DLOptions {
+    /** Profundidad máxima al desenrollar loops `α*`. */
+    loopUnfold?: number;
+    /** Cantidad de muestras temporales para evaluar ODEs continuas. */
+    odeSamples?: number;
+    /** Horizonte temporal máximo a explorar en ODEs. */
+    odeHorizon?: number;
+    /** Cantidad de valores muestrales para `x := *`. */
+    nondetSamples?: number[];
+    /** Estados iniciales explícitos. Si vacío, se genera una malla cubriendo las variables relevantes. */
+    initialStates?: State[];
+    /** Valores muestrales por defecto para construir la malla de iniciales. */
+    initialMesh?: number[];
+}
+/** Decisión: la fórmula es válida (vale en todo estado muestreado). */
+export interface DLCheckResult {
+    status: 'valid' | 'invalid' | 'satisfiable' | 'unsatisfiable' | 'unknown';
+    /** Contramodelo o testigo si aplica. */
+    witness?: State;
+    /** Cantidad de estados muestreados. */
+    statesChecked: number;
+}
+/**
+ * Decide si `f` es válida sobre toda la malla muestreada (criterio de
+ * validez universal acotada). Si encuentra contraejemplo lo retorna.
+ */
+export declare function checkValid(f: DLFormula, opts?: DLOptions): DLCheckResult;
+/** Decide si `f` es satisfacible en algún estado muestreado. */
+export declare function checkSatisfiable(f: DLFormula, opts?: DLOptions): DLCheckResult;
+/**
+ * Evalúa la fórmula en un estado específico — útil para casos donde el
+ * usuario quiere chequear desde una pre-condición concreta.
+ */
+export declare function evalInState(f: DLFormula, s: State, opts?: DLOptions): boolean;
+/** Re-export utilitario: lista de variables relevantes en la fórmula. */
+export declare function relevantVariables(f: DLFormula): string[];
+//# sourceMappingURL=tableau.d.ts.map

package/dist/logic/profiles/dl-hybrid/tableau.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tableau.d.ts","sourceRoot":"","sources":["../../../../src/logic/profiles/dl-hybrid/tableau.ts"],"names":[],"mappings":"AA+BA,OAAO,KAAK,EAAE,SAAS,EAAyB,KAAK,EAAE,MAAM,OAAO,CAAC;AAKrE,MAAM,WAAW,SAAS;IACxB,oDAAoD;IACpD,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,mEAAmE;IACnE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,oDAAoD;IACpD,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,oDAAoD;IACpD,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,sGAAsG;IACtG,aAAa,CAAC,EAAE,KAAK,EAAE,CAAC;IACxB,2EAA2E;IAC3E,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;CACxB;AA0MD,uEAAuE;AACvE,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,OAAO,GAAG,SAAS,GAAG,aAAa,GAAG,eAAe,GAAG,SAAS,CAAC;IAC1E,wCAAwC;IACxC,OAAO,CAAC,EAAE,KAAK,CAAC;IAChB,uCAAuC;IACvC,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,SAAS,GAAG,aAAa,CASxE;AAED,gEAAgE;AAChE,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,SAAS,GAAG,aAAa,CAS9E;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,SAAS,GAAG,OAAO,CAE7E;AAED,yEAAyE;AACzE,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,EAAE,CAgBxD"}

package/dist/logic/profiles/dl-hybrid/tableau.js

@@ -0,0 +1,289 @@
+"use strict";
+// ============================================================
+// ST dL-Hybrid — Decision procedure tipo tableau (subset)
+// ============================================================
+// Implementación pragmática y *no* completa del cálculo de pruebas de dL.
+// La idea: en lugar de un cálculo simbólico KeYmaera-completo, modelamos
+// el espacio de estados con muestreo sobre un conjunto finito de estados
+// iniciales generados a partir de la fórmula y exploramos las posibles
+// trayectorias del programa híbrido.
+//
+// Decisión:
+//   • Para mostrar `validez universal` exigimos que NO exista un estado
+//     en el universo finito muestreado que produzca un contraejemplo.
+//   • Para `satisfiabilidad` basta con encontrar un estado donde la
+//     fórmula se cumple.
+//
+// Este enfoque cubre los ejemplos canónicos del paper de Platzer con
+// dominio acotado y se comporta como un "model-finder con horizonte
+// finito" en lugar de un decision procedure completo. Para ODEs no
+// soportadas (clasifyOde → unsupported) responde `unknown`.
+//
+// Reglas operativas para [α]φ:
+//   • [x := e] φ            → φ[e/x]  evaluado en estado actual
+//   • [x := *] φ            → ∀v . φ[v/x]  aproximado con malla
+//   • [?ψ] φ                → ψ → φ
+//   • [α; β] φ              → [α][β] φ
+//   • [α ∪ β] φ             → [α]φ ∧ [β]φ
+//   • [α*] φ                → φ ∧ [α]φ ∧ [α;α]φ ∧ … (unfold a profundidad N)
+//   • [{x'=f & Q}] φ        → ∀t≥0 . (∀s∈[0,t] . Q(x(s))) → φ(x(t))
+//                              muestreado con malla temporal.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.checkValid = checkValid;
+exports.checkSatisfiable = checkSatisfiable;
+exports.evalInState = evalInState;
+exports.relevantVariables = relevantVariables;
+const ast_1 = require("./ast");
+const semantics_1 = require("./semantics");
+const differential_1 = require("./differential");
+const DEFAULTS = {
+    loopUnfold: 3,
+    odeSamples: 9,
+    odeHorizon: 5,
+    nondetSamples: [-2, -1, 0, 1, 2],
+    initialStates: [],
+    initialMesh: [-1, 0, 1, 2],
+};
+function withDefaults(opts) {
+    return { ...DEFAULTS, ...(opts ?? {}) };
+}
+/**
+ * Devuelve TODOS los estados de salida posibles tras ejecutar `prog`
+ * desde `s`. Para tests bloqueantes devuelve outcomes=[] con blocked=true.
+ * No es exhaustivo: muestrea estados.
+ */
+function executeProgram(prog, s, opts) {
+    switch (prog.kind) {
+        case 'assign': {
+            const next = (0, ast_1.cloneState)(s);
+            next.set(prog.varName, (0, semantics_1.evalTerm)(prog.rhs, s));
+            return { outcomes: [next] };
+        }
+        case 'nondet': {
+            const out = [];
+            for (const v of opts.nondetSamples) {
+                const ns = (0, ast_1.cloneState)(s);
+                ns.set(prog.varName, v);
+                out.push(ns);
+            }
+            return { outcomes: out };
+        }
+        case 'test': {
+            if ((0, semantics_1.evalQuantifierFree)(prog.cond, s))
+                return { outcomes: [s] };
+            return { outcomes: [], blocked: true };
+        }
+        case 'seq': {
+            const first = executeProgram(prog.left, s, opts);
+            const combined = [];
+            for (const mid of first.outcomes) {
+                const after = executeProgram(prog.right, mid, opts);
+                combined.push(...after.outcomes);
+            }
+            return { outcomes: combined };
+        }
+        case 'choice': {
+            const a = executeProgram(prog.left, s, opts);
+            const b = executeProgram(prog.right, s, opts);
+            return { outcomes: [...a.outcomes, ...b.outcomes] };
+        }
+        case 'loop': {
+            // Desenrolla hasta loopUnfold iteraciones; cada k es una posible salida.
+            const outcomes = [(0, ast_1.cloneState)(s)];
+            let current = [(0, ast_1.cloneState)(s)];
+            for (let k = 0; k < opts.loopUnfold; k++) {
+                const next = [];
+                for (const st of current) {
+                    const step = executeProgram(prog.body, st, opts);
+                    next.push(...step.outcomes);
+                }
+                if (next.length === 0)
+                    break;
+                outcomes.push(...next);
+                current = next;
+            }
+            return { outcomes };
+        }
+        case 'ode': {
+            const klass = (0, differential_1.classifyOde)(prog.system);
+            if (klass.kind === 'unsupported') {
+                // No podemos evaluar — devolvemos un outcome especial: el propio
+                // estado, marcando blocked si no hay dominio para verificar.
+                return { outcomes: [s], blocked: false };
+            }
+            const out = [];
+            const dt = opts.odeHorizon / Math.max(1, opts.odeSamples - 1);
+            for (let i = 0; i < opts.odeSamples; i++) {
+                const t = i * dt;
+                const ns = (0, differential_1.flow)(prog.system, s, t);
+                // Verifica dominio: si dominio falla en algún punto del segmento
+                // [0, t] descartamos. Aproximamos con malla.
+                if (prog.system.domain) {
+                    let ok = true;
+                    for (let j = 0; j <= i; j++) {
+                        const tau = j * dt;
+                        const inter = (0, differential_1.flow)(prog.system, s, tau);
+                        if (!(0, semantics_1.evalQuantifierFree)(prog.system.domain, inter)) {
+                            ok = false;
+                            break;
+                        }
+                    }
+                    if (!ok)
+                        continue;
+                }
+                out.push(ns);
+            }
+            // Siempre incluir t=0 al menos
+            if (out.length === 0)
+                out.push((0, ast_1.cloneState)(s));
+            return { outcomes: out };
+        }
+    }
+}
+/**
+ * Evalúa una fórmula dL sobre un estado concreto. Para modalidades
+ * recurre a `executeProgram`.
+ */
+function evalFormula(f, s, opts) {
+    switch (f.kind) {
+        case 'true':
+            return true;
+        case 'false':
+            return false;
+        case 'comp':
+            return (0, semantics_1.evalQuantifierFree)(f, s);
+        case 'not':
+            return !evalFormula(f.arg, s, opts);
+        case 'and':
+            return evalFormula(f.left, s, opts) && evalFormula(f.right, s, opts);
+        case 'or':
+            return evalFormula(f.left, s, opts) || evalFormula(f.right, s, opts);
+        case 'implies':
+            return !evalFormula(f.left, s, opts) || evalFormula(f.right, s, opts);
+        case 'iff':
+            return evalFormula(f.left, s, opts) === evalFormula(f.right, s, opts);
+        case 'box': {
+            const step = executeProgram(f.program, s, opts);
+            // [α]φ: en TODOS los outcomes φ debe valer.
+            // Si el test bloquea (sin outcomes), [?ψ]φ es vacuously true.
+            for (const out of step.outcomes) {
+                if (!evalFormula(f.post, out, opts))
+                    return false;
+            }
+            return true;
+        }
+        case 'diamond': {
+            const step = executeProgram(f.program, s, opts);
+            // ⟨α⟩φ: existe un outcome donde φ vale.
+            for (const out of step.outcomes) {
+                if (evalFormula(f.post, out, opts))
+                    return true;
+            }
+            return false;
+        }
+    }
+}
+/** Genera una malla de estados iniciales según las variables libres de la fórmula. */
+function generateInitialStates(f, opts) {
+    if (opts.initialStates.length > 0)
+        return opts.initialStates;
+    const vars = Array.from((0, ast_1.formulaVars)(f));
+    // También variables modificadas dentro de programas (parten de un valor inicial).
+    if (vars.length === 0)
+        return [new Map()];
+    // Producto cartesiano de la malla — limita a 4 vars máx para evitar explosión.
+    if (vars.length > 4) {
+        // Modo light: usa sólo {0, 1, -1} para cada var y limita combinaciones.
+        const mesh = [-1, 0, 1];
+        const states = [];
+        // Una muestra "todo a v" por cada v
+        for (const v of mesh) {
+            const s = new Map();
+            for (const x of vars)
+                s.set(x, v);
+            states.push(s);
+        }
+        // Una muestra mixta: variable individual con valor distinto
+        for (let i = 0; i < vars.length; i++) {
+            for (const v of mesh) {
+                const s = new Map();
+                for (let j = 0; j < vars.length; j++) {
+                    s.set(vars[j] ?? '', j === i ? v : 0);
+                }
+                states.push(s);
+            }
+        }
+        return states;
+    }
+    const mesh = opts.initialMesh;
+    const result = [];
+    const recurse = (idx, current) => {
+        if (idx === vars.length) {
+            result.push(new Map(current));
+            return;
+        }
+        const v = vars[idx];
+        if (!v)
+            return;
+        for (const val of mesh) {
+            current.set(v, val);
+            recurse(idx + 1, current);
+        }
+    };
+    recurse(0, new Map());
+    return result;
+}
+/**
+ * Decide si `f` es válida sobre toda la malla muestreada (criterio de
+ * validez universal acotada). Si encuentra contraejemplo lo retorna.
+ */
+function checkValid(f, opts) {
+    const o = withDefaults(opts);
+    const states = generateInitialStates(f, o);
+    for (const s of states) {
+        if (!evalFormula(f, s, o)) {
+            return { status: 'invalid', witness: s, statesChecked: states.length };
+        }
+    }
+    return { status: 'valid', statesChecked: states.length };
+}
+/** Decide si `f` es satisfacible en algún estado muestreado. */
+function checkSatisfiable(f, opts) {
+    const o = withDefaults(opts);
+    const states = generateInitialStates(f, o);
+    for (const s of states) {
+        if (evalFormula(f, s, o)) {
+            return { status: 'satisfiable', witness: s, statesChecked: states.length };
+        }
+    }
+    return { status: 'unsatisfiable', statesChecked: states.length };
+}
+/**
+ * Evalúa la fórmula en un estado específico — útil para casos donde el
+ * usuario quiere chequear desde una pre-condición concreta.
+ */
+function evalInState(f, s, opts) {
+    return evalFormula(f, s, withDefaults(opts));
+}
+/** Re-export utilitario: lista de variables relevantes en la fórmula. */
+function relevantVariables(f) {
+    const acc = (0, ast_1.formulaVars)(f);
+    // Incluir variables que sólo aparecen dentro de programas modales
+    const inner = (g) => {
+        if (g.kind === 'box' || g.kind === 'diamond') {
+            (0, ast_1.programVars)(g.program, acc);
+            inner(g.post);
+        }
+        else if (g.kind === 'and' || g.kind === 'or' || g.kind === 'implies' || g.kind === 'iff') {
+            inner(g.left);
+            inner(g.right);
+        }
+        else if (g.kind === 'not') {
+            inner(g.arg);
+        }
+    };
+    inner(f);
+    return Array.from(acc);
+}
+//# sourceMappingURL=tableau.js.map

package/dist/logic/profiles/dl-hybrid/tableau.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tableau.js","sourceRoot":"","sources":["../../../../src/logic/profiles/dl-hybrid/tableau.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,0DAA0D;AAC1D,+DAA+D;AAC/D,0EAA0E;AAC1E,yEAAyE;AACzE,yEAAyE;AACzE,uEAAuE;AACvE,qCAAqC;AACrC,EAAE;AACF,YAAY;AACZ,wEAAwE;AACxE,sEAAsE;AACtE,oEAAoE;AACpE,yBAAyB;AACzB,EAAE;AACF,qEAAqE;AACrE,oEAAoE;AACpE,mEAAmE;AACnE,4DAA4D;AAC5D,EAAE;AACF,+BAA+B;AAC/B,gEAAgE;AAChE,gEAAgE;AAChE,oCAAoC;AACpC,uCAAuC;AACvC,0CAA0C;AAC1C,6EAA6E;AAC7E,oEAAoE;AACpE,8DAA8D;AAC9D,+DAA+D;;AA2O/D,gCASC;AAGD,4CASC;AAMD,kCAEC;AAGD,8CAgBC;AAxRD,+BAA6D;AAC7D,2CAA2D;AAC3D,iDAAmD;AAiBnD,MAAM,QAAQ,GAAwB;IACpC,UAAU,EAAE,CAAC;IACb,UAAU,EAAE,CAAC;IACb,UAAU,EAAE,CAAC;IACb,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAChC,aAAa,EAAE,EAAE;IACjB,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;CAC3B,CAAC;AAEF,SAAS,YAAY,CAAC,IAAgB;IACpC,OAAO,EAAE,GAAG,QAAQ,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,CAAC;AAC1C,CAAC;AAUD;;;;GAIG;AACH,SAAS,cAAc,CAAC,IAAmB,EAAE,CAAQ,EAAE,IAAyB;IAC9E,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,IAAI,GAAG,IAAA,gBAAU,EAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAA,oBAAQ,EAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAC9C,OAAO,EAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,GAAG,GAAY,EAAE,CAAC;YACxB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBACnC,MAAM,EAAE,GAAG,IAAA,gBAAU,EAAC,CAAC,CAAC,CAAC;gBACzB,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;gBACxB,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,CAAC;YACD,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;QAC3B,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,IAAA,8BAAkB,EAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;gBAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/D,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;QACzC,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YACjD,MAAM,QAAQ,GAAY,EAAE,CAAC;YAC7B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACjC,MAAM,KAAK,GAAG,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;gBACpD,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;YACnC,CAAC;YACD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;QAChC,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YAC7C,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YAC9C,OAAO,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;QACtD,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,yEAAyE;YACzE,MAAM,QAAQ,GAAY,CAAC,IAAA,gBAAU,EAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,OAAO,GAAY,CAAC,IAAA,gBAAU,EAAC,CAAC,CAAC,CAAC,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,IAAI,GAAY,EAAE,CAAC;gBACzB,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;oBACzB,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;oBACjD,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC9B,CAAC;gBACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;oBAAE,MAAM;gBAC7B,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;gBACvB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;YACD,OAAO,EAAE,QAAQ,EAAE,CAAC;QACtB,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvC,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBACjC,iEAAiE;gBACjE,6DAA6D;gBAC7D,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;YAC3C,CAAC;YACD,MAAM,GAAG,GAAY,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;YAC9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;gBACjB,MAAM,EAAE,GAAG,IAAA,mBAAI,EAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBACnC,iEAAiE;gBACjE,6CAA6C;gBAC7C,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;oBACvB,IAAI,EAAE,GAAG,IAAI,CAAC;oBACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC5B,MAAM,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;wBACnB,MAAM,KAAK,GAAG,IAAA,mBAAI,EAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;wBACxC,IAAI,CAAC,IAAA,8BAAkB,EAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;4BACnD,EAAE,GAAG,KAAK,CAAC;4BACX,MAAM;wBACR,CAAC;oBACH,CAAC;oBACD,IAAI,CAAC,EAAE;wBAAE,SAAS;gBACpB,CAAC;gBACD,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,CAAC;YACD,+BAA+B;YAC/B,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,IAAA,gBAAU,EAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;QAC3B,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,WAAW,CAAC,CAAY,EAAE,CAAQ,EAAE,IAAyB;IACpE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,IAAI,CAAC;QACd,KAAK,OAAO;YACV,OAAO,KAAK,CAAC;QACf,KAAK,MAAM;YACT,OAAO,IAAA,8BAAkB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,KAAK,KAAK;YACR,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACtC,KAAK,KAAK;YACR,OAAO,WAAW,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACvE,KAAK,IAAI;YACP,OAAO,WAAW,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACvE,KAAK,SAAS;YACZ,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACxE,KAAK,KAAK;YACR,OAAO,WAAW,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACxE,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YAChD,4CAA4C;YAC5C,8DAA8D;YAC9D,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC;oBAAE,OAAO,KAAK,CAAC;YACpD,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YAChD,wCAAwC;YACxC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChC,IAAI,WAAW,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;YAClD,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;AACH,CAAC;AAED,sFAAsF;AACtF,SAAS,qBAAqB,CAAC,CAAY,EAAE,IAAyB;IACpE,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC,aAAa,CAAC;IAC7D,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAA,iBAAW,EAAC,CAAC,CAAC,CAAC,CAAC;IACxC,kFAAkF;IAClF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;IAC1C,+EAA+E;IAC/E,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpB,wEAAwE;QACxE,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,MAAM,MAAM,GAAY,EAAE,CAAC;QAC3B,oCAAoC;QACpC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,CAAC,GAAU,IAAI,GAAG,EAAE,CAAC;YAC3B,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;QACD,4DAA4D;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,CAAC,GAAU,IAAI,GAAG,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxC,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;IAC9B,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,CAAC,GAAW,EAAE,OAAc,EAAQ,EAAE;QACpD,IAAI,GAAG,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;YAC9B,OAAO;QACT,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,CAAC;YAAE,OAAO;QACf,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC,CAAC;IACF,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACtB,OAAO,MAAM,CAAC;AAChB,CAAC;AAWD;;;GAGG;AACH,SAAgB,UAAU,CAAC,CAAY,EAAE,IAAgB;IACvD,MAAM,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAC7B,MAAM,MAAM,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,EAAE,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;QACzE,CAAC;IACH,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;AAC3D,CAAC;AAED,gEAAgE;AAChE,SAAgB,gBAAgB,CAAC,CAAY,EAAE,IAAgB;IAC7D,MAAM,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAC7B,MAAM,MAAM,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACzB,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,EAAE,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;QAC7E,CAAC;IACH,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;AACnE,CAAC;AAED;;;GAGG;AACH,SAAgB,WAAW,CAAC,CAAY,EAAE,CAAQ,EAAE,IAAgB;IAClE,OAAO,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,yEAAyE;AACzE,SAAgB,iBAAiB,CAAC,CAAY;IAC5C,MAAM,GAAG,GAAG,IAAA,iBAAW,EAAC,CAAC,CAAC,CAAC;IAC3B,kEAAkE;IAClE,MAAM,KAAK,GAAG,CAAC,CAAY,EAAQ,EAAE;QACnC,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC7C,IAAA,iBAAW,EAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YAC5B,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChB,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC3F,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACd,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACjB,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC5B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;IACH,CAAC,CAAC;IACF,KAAK,CAAC,CAAC,CAAC,CAAC;IACT,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC"}

package/dist/reasoning/dl-hybrid/__tests__/invariant.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=invariant.test.d.ts.map

package/dist/reasoning/dl-hybrid/__tests__/invariant.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"invariant.test.d.ts","sourceRoot":"","sources":["../../../../src/reasoning/dl-hybrid/__tests__/invariant.test.ts"],"names":[],"mappings":""}

package/dist/reasoning/dl-hybrid/__tests__/invariant.test.js

@@ -0,0 +1,74 @@
+"use strict";
+// ============================================================
+// ST dL-Hybrid Reasoning — Invariant search tests
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const invariant_search_1 = require("../invariant-search");
+const dl_hybrid_1 = require("../../../logic/profiles/dl-hybrid");
+const dl_hybrid_2 = require("../../../logic/profiles/dl-hybrid");
+function ode(src) {
+    const p = (0, dl_hybrid_1.parseProgram)(src);
+    if (p.kind !== 'ode')
+        throw new Error('Esperaba ODE');
+    return p.system;
+}
+(0, vitest_1.describe)('dl-hybrid reasoning — checkDifferentialInvariant', () => {
+    (0, vitest_1.it)("x es invariante con L_f exacto 0 para x' = 0", () => {
+        // L_f(x) = 0  → exacto.
+        const v = (0, invariant_search_1.checkDifferentialInvariant)((0, dl_hybrid_2.variable)('x'), ode("{x' = 0}"));
+        (0, vitest_1.expect)(v.kind).toBe('invariant');
+        if (v.kind === 'invariant')
+            (0, vitest_1.expect)(v.reason).toBe('exact');
+    });
+    (0, vitest_1.it)("x es invariante para x' = 1 (L_f = 1 ≥ 0)", () => {
+        const v = (0, invariant_search_1.checkDifferentialInvariant)((0, dl_hybrid_2.variable)('x'), ode("{x' = 1}"));
+        (0, vitest_1.expect)(v.kind).toBe('invariant');
+    });
+    (0, vitest_1.it)("x NO es invariante para x' = -1 (L_f = -1 < 0)", () => {
+        const v = (0, invariant_search_1.checkDifferentialInvariant)((0, dl_hybrid_2.variable)('x'), ode("{x' = -1}"));
+        (0, vitest_1.expect)(v.kind).toBe('not-invariant');
+    });
+    (0, vitest_1.it)("x² + y² es invariante para rotación (x' = -y, y' = x)", () => {
+        const sys = {
+            equations: [
+                { varName: 'x', rhs: { kind: 'neg', arg: (0, dl_hybrid_2.variable)('y') } },
+                { varName: 'y', rhs: (0, dl_hybrid_2.variable)('x') },
+            ],
+        };
+        const p = (0, dl_hybrid_2.plus)((0, dl_hybrid_2.power)((0, dl_hybrid_2.variable)('x'), 2), (0, dl_hybrid_2.power)((0, dl_hybrid_2.variable)('y'), 2));
+        const v = (0, invariant_search_1.checkDifferentialInvariant)(p, sys);
+        (0, vitest_1.expect)(v.kind).toBe('invariant');
+        // El simplificador no necesariamente reduce 2x(-y)+2yx a const 0,
+        // pero numéricamente la malla evidencia el invariante.
+        if (v.kind === 'invariant') {
+            (0, vitest_1.expect)(['exact', 'lie-nonnegative']).toContain(v.reason);
+        }
+    });
+    (0, vitest_1.it)("x NO es invariante para x' = x*y (refutable con muestra x=-1, y=2)", () => {
+        // Sistema acoplado: chequeamos numéricamente, no por solubilidad cerrada.
+        const sys = ode("{x' = x * y}");
+        const v = (0, invariant_search_1.checkDifferentialInvariant)((0, dl_hybrid_2.variable)('x'), sys);
+        (0, vitest_1.expect)(v.kind).toBe('not-invariant');
+    });
+});
+(0, vitest_1.describe)('dl-hybrid reasoning — suggestInvariants', () => {
+    (0, vitest_1.it)("encuentra al menos un invariante para x' = 1 (x ≥ -1 o ≥ 0)", () => {
+        const sys = ode("{x' = 1}");
+        const found = (0, invariant_search_1.suggestInvariants)(sys);
+        (0, vitest_1.expect)(found.length).toBeGreaterThan(0);
+    });
+    (0, vitest_1.it)('describeVerdict produce string informativo', () => {
+        const sys = ode("{x' = 1}");
+        const found = (0, invariant_search_1.suggestInvariants)(sys);
+        (0, vitest_1.expect)(found.length).toBeGreaterThan(0);
+        const first = found[0];
+        (0, vitest_1.expect)(first).toBeDefined();
+        if (first) {
+            const desc = (0, invariant_search_1.describeVerdict)(first);
+            (0, vitest_1.expect)(typeof desc).toBe('string');
+            (0, vitest_1.expect)(desc.length).toBeGreaterThan(0);
+        }
+    });
+});
+//# sourceMappingURL=invariant.test.js.map

package/dist/reasoning/dl-hybrid/__tests__/invariant.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"invariant.test.js","sourceRoot":"","sources":["../../../../src/reasoning/dl-hybrid/__tests__/invariant.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,kDAAkD;AAClD,+DAA+D;;AAE/D,mCAA8C;AAC9C,0DAI6B;AAC7B,iEAAiE;AACjE,iEAA0E;AAG1E,SAAS,GAAG,CAAC,GAAW;IACtB,MAAM,CAAC,GAAG,IAAA,wBAAY,EAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;IACtD,OAAO,CAAC,CAAC,MAAM,CAAC;AAClB,CAAC;AAED,IAAA,iBAAQ,EAAC,kDAAkD,EAAE,GAAG,EAAE;IAChE,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,wBAAwB;QACxB,MAAM,CAAC,GAAG,IAAA,6CAA0B,EAAC,IAAA,oBAAQ,EAAC,GAAG,CAAC,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACjC,IAAI,CAAC,CAAC,IAAI,KAAK,WAAW;YAAE,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,6CAA0B,EAAC,IAAA,oBAAQ,EAAC,GAAG,CAAC,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,GAAG,IAAA,6CAA0B,EAAC,IAAA,oBAAQ,EAAC,GAAG,CAAC,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;QACtE,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,GAAG,GAAc;YACrB,SAAS,EAAE;gBACT,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAA,oBAAQ,EAAC,GAAG,CAAC,EAAE,EAAE;gBAC1D,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,IAAA,oBAAQ,EAAC,GAAG,CAAC,EAAE;aACrC;SACF,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,gBAAI,EAAC,IAAA,iBAAK,EAAC,IAAA,oBAAQ,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,iBAAK,EAAC,IAAA,oBAAQ,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjE,MAAM,CAAC,GAAG,IAAA,6CAA0B,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACjC,kEAAkE;QAClE,uDAAuD;QACvD,IAAI,CAAC,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC3B,IAAA,eAAM,EAAC,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,0EAA0E;QAC1E,MAAM,GAAG,GAAG,GAAG,CAAC,cAAc,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,IAAA,6CAA0B,EAAC,IAAA,oBAAQ,EAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,IAAA,oCAAiB,EAAC,GAAG,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,IAAA,oCAAiB,EAAC,GAAG,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QAC5B,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,IAAI,GAAG,IAAA,kCAAe,EAAC,KAAK,CAAC,CAAC;YACpC,IAAA,eAAM,EAAC,OAAO,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACnC,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/reasoning/dl-hybrid/index.d.ts

@@ -0,0 +1,3 @@
+export type { InvariantVerdict, InvariantOptions, CandidateResult } from './invariant-search';
+export { checkDifferentialInvariant, suggestInvariants, describeVerdict, } from './invariant-search';
+//# sourceMappingURL=index.d.ts.map

package/dist/reasoning/dl-hybrid/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/reasoning/dl-hybrid/index.ts"],"names":[],"mappings":"AASA,YAAY,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAC9F,OAAO,EACL,0BAA0B,EAC1B,iBAAiB,EACjB,eAAe,GAChB,MAAM,oBAAoB,CAAC"}