Documentation

Determinize.Proof.FiniteModel.IndexedGraph

theorem Determinize.Proof.FiniteModel.weightedOutput_indexed {n : ℕ} (states : Fin n → Finite.State) (fallback : Fin n) (outcomes : List (ℚ × Finite.State)) (indices : ℕ → ℕ) (nonnegative : ∀ outcome ∈ outcomes, 0 ≤ outcome.1) (covered : ∀ (k : Fin outcomes.length), 0 < outcomes[k].1 → ∃ (bound : indices ↑k < n), states ⟨indices ↑k, bound⟩ = outcomes[k].2) (output : Finite.State → MeasureTheory.Measure ℝ) :
weightedOutput outcomes output = ∑ j : Fin n, ENNReal.ofReal ↑(Finite.indexedMass outcomes indices ↑j) • output (states j)

Push probability mass through supplied indices. Equal state labels are allowed.

theorem Determinize.Proof.FiniteModel.indexedReplay_machineOutput (candidate : Finite.Candidate) {source : Spec.Paper.Core} {subject : Spec.FiniteModel.Subject} (indices : Fin candidate.states.size → ℕ → ℕ) (valid : candidate.IndexedReplayValid source subject indices) (fuel : ℕ) (i : Fin candidate.states.size) :
(candidate.graphModel ⋯).outputWithin fuel i = machineOutput fuel (candidate.state i)
theorem Determinize.Proof.FiniteModel.indexedReplay_matches (candidate : Finite.Candidate) {source : Spec.Paper.Core} {subject : Spec.FiniteModel.Subject} (indices : Fin candidate.states.size → ℕ → ℕ) (valid : candidate.IndexedReplayValid source subject indices) :
(candidate.graphModel ⋯).Matches (subject.program source)