While this submission is a draft, it cannot be used by other submissions.

Small finite models for modal parity acceptance

Lax369799.ModalSmallModels · concepts/Lax369799/ModalSmallModels.lean · lax-369799

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    If a modal acceptance game wins on a finite transition system, it wins on a finite reachable system with at most as many vertices as the word condition has states. Alternating simulations and positional strategies supply the bound needed for the finite-search effectivity argument.

    Concept map
    16 concepts; 3 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.ModalAcceptanceGame
    2
    3/-!
    4---
    5title: Small finite models for modal parity acceptance
    6type: theorem
    7---
    8If a modal acceptance game wins on a finite transition system, it wins
    9on a finite reachable system with at most as many vertices as the word
    10condition has states. Alternating simulations and positional strategies
    11supply the bound needed for the finite-search effectivity argument.
    12-/
    13
    14namespace Lax369799.ModalSmallModels
    15open TransitionEncoding TransitionSystems UnfoldAutomata ParityWinningRegions
    16
    17axiom small_model {P : Type} (M : UnfoldAutomaton (TransitionAlphabet P)) (S : TransitionSystem P)
    18 (h : Winning (ModalAcceptanceGame.game M S) true
    19 (ModalAcceptanceGame.position M.condition.initial S.initial)) :
    20 ∃ T : TransitionSystem P,T.size ≤ M.condition.states ∧
    21 Winning (ModalAcceptanceGame.game M T) true
    22 (ModalAcceptanceGame.position M.condition.initial T.initial)
    23
    24end Lax369799.ModalSmallModels
    25
    Show Proof

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…