Compute robust operating viability kernel

Compute the maximal robust controlled-invariant set of safe operating states under complete set-valued state-action transitions, identify every feedback action that keeps all modeled successors viable indefinitely, and expose finite guaranteed-survival layers for states outside the kernel without using probabilities or rewards.

What it's for

Moves Gitrevio beyond risk scores into robust operational control: leaders can see which operating states remain governable under every modeled disruption, which actions preserve the safe region, and how much response time remains outside it.

What you give it

Inputs split into evidence read from your connected systems, calibration your team owns, and numerical controls that affect precision but never the result's meaning.

Field Type Role Required
actions array of objects (1 field) ≥ 1 item Evidence Yes
initial_state_ids array of string ≥ 1 item Evidence Yes
max_detail_rows integer ≥ 1, ≤ 500 Numerical control Optional
required_safe_steps integer ≥ 1, ≤ 500 Your calibration Optional
states array of objects (2 fields) ≥ 2 items Evidence Yes
transitions array of objects (3 fields) ≥ 2 items Evidence Yes

Each transitions record

Field Type Required
action_id string (non-empty) Yes
possible_next_state_ids array of string (≥ 1 item) Yes
state_id string (non-empty) Yes
Example input
{
  "actions": [
    {
      "id": "stabilize"
    },
    {
      "id": "accelerate"
    }
  ],
  "initial_state_ids": [
    "healthy",
    "strained"
  ],
  "required_safe_steps": 4,
  "states": [
    {
      "id": "healthy",
      "safe": true
    },
    {
      "id": "strained",
      "safe": true
    },
    {
      "id": "failed",
      "safe": false
    }
  ],
  "transitions": [
    {
      "action_id": "stabilize",
      "possible_next_state_ids": [
        "healthy"
      ],
      "state_id": "healthy"
    },
    {
      "action_id": "accelerate",
      "possible_next_state_ids": [
        "healthy",
        "strained"
      ],
      "state_id": "healthy"
    },

Truncated for display — the full payload is 75 lines.

What you get back

This is the actual output of running the example above — computed by the same function the platform calls, not an illustration.

Example output
{
  "assumptions": [
    "States are decision-sufficient at the chosen cadence, safe labels encode hard governed constraints, and every feasible action is represented for every state.",
    "possible_next_state_ids are a conservative set containing every materially possible successor under that state-action pair; omitted successors can create false safety.",
    "The transition envelope and action feasibility remain stable for the period in which the invariant policy is used."
  ],
  "decision": "all_initial_states_robustly_viable",
  "detail_counts": {
    "state_diagnostics": 3,
    "viable_policy_states": 2
  },
  "executive_summary": {
    "fixed_point_iterations": 1,
    "infinite_viability_kernel_states": 2,
    "initial_states": 2,
    "safe_states": 2,
    "states": 3,
    "viability_fraction_of_safe_states": 1,
    "viable_initial_states": 2
  },
  "initial_state_assessment": [
    {
      "action_exposure": [],
      "guaranteed_safe_steps": null,
      "in_infinite_viability_kernel": true,
      "meets_required_safe_horizon": true,
      "removal_iteration": null,
      "robustly_safe_action_ids": [
        "stabilize",
        "accelerate"
      ],
      "safe_now": true,
      "state_id": "healthy"
    },
    {
      "action_exposure": [
        {
          "action_id": "accelerate",
          "immediate_unsafe_successors": [
            "failed"
          ],
          "successors_outside_infinite_kernel": [
            "failed"
          ]

Truncated for display — the full payload is 149 lines.

How it works

Forecasting & survival — Estimate when something completes or fails, with censoring and unresolved work handled honestly rather than dropped.

  1. 1 Start with every state satisfying the governed hard safety constraints and require one complete, nonempty set of materially possible successors for every state-action pair.
  2. 2 Apply the robust predecessor operator repeatedly: retain a safe state only when at least one feasible action has every possible successor inside the previous safe set.
  3. 3 Continue the monotone elimination to a fixed point; the result is the maximal robust controlled-invariant viability kernel, and actions whose full successor set remains inside it form the safe feedback policy.
  4. 4 Record the elimination iteration for nonviable states to show finite guaranteed-safe steps, evaluate the governed initial states and required finite horizon, and expose unsafe or nonviable successors by action rather than inventing a least-bad safe claim.

Before you trust it

Every tool in the catalog ships with the conditions under which its answer is meaningful — and the conditions under which it should abstain instead of guessing.

Assumptions & guardrails

  • Training examples precede their outcomes, censoring and unresolved work are represented, and deployment populations remain comparable to validation cohorts.
  • States are decision-sufficient at the intervention cadence, safe labels encode genuinely hard constraints, actions are feasible where declared, and transition successor sets conservatively include all material model uncertainty.
  • The transition envelope is stable over the policy-use period; missing a rare successor is more dangerous than assigning it a low probability because robust invariance treats every supplied successor as possible.
  • A predictive interval or risk estimate is not a deadline promise, causal explanation, or individual-performance judgment.
  • Membership is a guarantee only within the supplied state abstraction, action feasibility, successor envelope, and stationarity period; it is not a probability of safety or protection against omitted shocks.
  • A state outside the infinite kernel may still support a finite response window, but the engine does not label an unsafe action acceptable, optimize reward, or authorize operation beyond accountable constraints.

Minimum evidence

  • states: at least 2 rows/items
  • actions: at least 1 rows/items
  • transitions: at least 2 rows/items
  • initial_state_ids: at least 1 rows/items

How to validate it

Validate on future periods or held-out aggregate units, compare with a simple baseline, and require stability across plausible metric definitions and decision thresholds.

Calibrating it to your org

Same for everyone

The mathematical kernel, validation rules, method version, and JSON output semantics are organization-independent; no tenant-trained coefficients or company benchmark is embedded in the function.

Specific to you

  • decision-sufficient discrete state vocabulary and conservative possible-successor set for every feasible state-action pair
  • current aggregate initial-state mapping and held-out transition-envelope coverage audit
  • hard safety constraints, intervention cadence, feasible action catalog, uncertainty-set construction, required safe horizon, and acceptable response authority

Calibration workflow

  1. 1 Define the management decision, target outcome, aggregate unit, privacy boundary, cadence, and prediction/intervention horizon for this organization.
  2. 2 Build a tenant-scoped historical cohort using only information available before each prediction or decision; preserve zero periods, censoring, assignment probabilities, and unresolved outcomes when the method requires them.
  3. 3 Estimate statistical parameters on training history, but obtain costs, utilities, risk tolerance, practical-effect thresholds, capacity, and policy constraints from accountable decision owners.
  4. 4 Validate on later time windows or held-out aggregate units at the deployment grain, against a simple baseline and the function-specific validation strategy.
  5. 5 Deploy only if the returned decision clears evidence, overlap, calibration, robustness, and guardrail checks; warning, unsupported, schema-gap, and fallback decisions are abstentions.
  6. 6 Monitor realized outcomes, data drift, coverage, and decision regret; recalibrate at a governed cadence or after a detected regime/definition change, never merely because a stakeholder dislikes the result.

Call it from your AI

You don't wire up 388 tools in your MCP client. The GitRevio MCP server exposes 18 tools, three of which let an agent search the catalog, read a tool's schema, and run it — so the assistant finds this one on its own.

gitrevio_capabilities_search
  { "q": "compute the maximal robust controlledinvariant set" }
  → finds "compute_robust_operating_viability_kernel"

gitrevio_capability_describe
  { "capability_id": "compute_robust_operating_viability_kernel" }
  → returns the input schema and agent guidance shown on this page

gitrevio_capability_run
  { "capability_id": "compute_robust_operating_viability_kernel", "arguments": { ... } }
  → returns the result shown above

Works in Claude Desktop, Claude Code, Cursor, Cline, Continue.dev, Goose and Aider. See the MCP server.

Related tools

Audit point in time model integrity

Gate an analytical or AI model on point-in-time correctness by auditing actual feature availability, snapshot creation, target-window ordering, outcome resolution, source-record reuse, and embargoed train/calibration/test boundaries, with row and feature diagnostics rather than a generic leakage warning.

Statistical audit & measurement

Forecast engineering investment benefit realization

Forecast whether an engineering-investment portfolio will realize finance-defined benefits within a decision horizon using a partially pooled Bayesian hurdle/lognormal model for zero-benefit risk, positive benefit multiples, and realization lag; correlated organization shocks; discounting; NPV/ROI gates; and explicit unseen-category fallback.

Sequential Bayesian & bandits

Analyze deep uncertainty minimax regret

Apply Savage minimax regret when scenario probabilities are not defensible, compare maximin and equal-weight choices, and use PRIM-style iterative peeling to discover compact context boxes where the robust choice remains vulnerable.

Decision analysis

Audit aggregate metric reversal

Detect Simpson's-paradox-style sign reversals between an executive aggregate relationship and its weighted within-stratum fixed-effect relationship, with whole-stratum bootstrap uncertainty and practical-magnitude gates.

Statistical audit & measurement

Audit informative metric missingness

Audit whether aggregate metric availability is associated with a governed outcome using permutation inference, bootstrap intervals, practical effect gates, and false-discovery control.

Statistical audit & measurement

Audit joint metric dependency drift

Detect changes in cross-metric dependence with empirical-copula ranks, random-feature permutation inference, sliced Wasserstein magnitude, and FDR-controlled pair diagnostics.

Statistical audit & measurement

See every tool in Measurement integrity →

Ready to See Your Engineering work clearly?

Request a free demo