Almost Fair Simulations
summary
Proves that language inclusion for nondeterministic Büchi automata can be established by a family of fairness‑preserving simulations: direct simulation, delay simulation, and a new repeated delay simulation. Mechanization in the Rocq proof assistant gives machine‑checked soundness and deductive systems built from guarded‑context triples (left/right/waiting) using parameterized coinduction. Concrete examples include a concurrent A/B‑printing scheduler; the systems let proofs skip finitely many obligations and handle infinite‑state models, though some weaker coinductive‑inductive fairness cases remain uncovered.
AI-written summary · about