RQM Execution Plan Select

Problem: Validate timestamps, ordering, rates, gaps, and synchronization in this bounded trajectory or sensor trace. Input: JSON with clock id, samples, rules. Result: pass or fail verdict, normalized timeline, exact timing defects. Limits: Software/model evidence only; 65536 request bytes; 5 s execution.

Problem: Select a supported execution plan against the supplied cost, depth, duration limits, and weights. Input: JSON with plans, weights, maximum cost usd, maximum depth, maximum duration seconds. Result: ranked feasible plans, objective scores, selected plan identity. Limits: Local software evidence only; 4096 operations; 65536 request bytes.

Problem: Compare these bounded estimator outputs against the supplied reference and objective rules. Input: JSON with reference, estimators, rules. Result: per-estimator metrics, rule verdicts, deterministic selected estimator or.... Limits: Software/model evidence only; 65536 request bytes; 5 s execution.

Problem: Compare planned and observed trajectories against caller tolerances. Input: JSON with planned, observed, rules. Result: typed verdict, measured metrics, candidate only when verified. Limits: Software/model evidence only; 65536 request bytes; 5 s execution.