Skip to content
Rainbow docs menu

Reference · The Applied Higher-Order Functions catalogue

rainbow.algorithms.proofs.ahof.ltl-model-checking

The Applied Higher-Order Functions cataloguesrc/rainbow/algorithms/proofs/ahof/ltl_model_checking.clj1 definitions, 4 theorems

AHoF V7 LTL Model Checking: check a Linear Temporal Logic specification against a system; quantitatively the spec is satisfied when the trace robustness meets the required margin: satisfied? margin robustness = decide (margin <= robustness). Proved native and axiom-free (decision, two positive instances, at-most certificate, negative instance). Requires audit/decide-nnrat-at-most, nnrat/at-most, nnrat/decide-at-most-true-sound (all in the D63 checkpoint). Scope (measured by the kernel): this module has 4 worked instances (statements about specific values). None of its theorems is a guarantee about the algorithm for all inputs; `lein verify rainbow.algorithms.proofs.ahof.ltl-model-checking` prints this classification.

ltl/satisfied?

DefinitionSource, line 44

ltl/satisfied? :
  (x₁ x₂ : ℚ≥0)
  → data/Bool

ℚ≥0 = nnrat/NonnegativeRational

ltl/robust-trace-satisfies

TheoremWorked exampleNo axiomsSource, line 51

ltl/robust-trace-satisfies :
  → lis/extends? 1/2 3/4 = data/true

= = equality/Eq

ltl/boundary-satisfies

TheoremWorked exampleNo axiomsSource, line 57

ltl/boundary-satisfies :
  → lis/extends? 1/2 1/2 = data/true

= = equality/Eq

ltl/satisfaction-certificate

TheoremWorked exampleNo axiomsSource, line 63

ltl/satisfaction-certificate :
  → 1/2 ≤ 3/4

≤ = nnrat/at-most

ltl/weak-trace-violates

TheoremWorked exampleNo axiomsSource, line 68

ltl/weak-trace-violates :
  → lis/extends? 1/2 1/4 = data/false

= = equality/Eq