Small finite models for modal parity acceptance
Lax369799.ModalSmallModels · concepts/Lax369799/ModalSmallModels.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural 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
Lean source view on GitHub
| 1 | import Lax369799.ModalAcceptanceGame |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Small finite models for modal parity acceptance |
| 6 | type: theorem |
| 7 | --- |
| 8 | If a modal acceptance game wins on a finite transition system, it wins |
| 9 | on a finite reachable system with at most as many vertices as the word |
| 10 | condition has states. Alternating simulations and positional strategies |
| 11 | supply the bound needed for the finite-search effectivity argument. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax369799.ModalSmallModels |
| 15 | open TransitionEncoding TransitionSystems UnfoldAutomata ParityWinningRegions |
| 16 | |
| 17 | axiom 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 | |
| 24 | end Lax369799.ModalSmallModels |
| 25 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments