Realizing winning clone-automaton strategies
Lax369799.CloneGameRun · concepts/Lax369799/CloneGameRun.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Duplicate transition components to cover every permitted successor of a winning marking. The reachable part of this finite strategy construction is bisimilar to the input system and carries an accepting automaton run.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.AutomatonRunGame |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Realizing winning clone-automaton strategies |
| 6 | type: theorem |
| 7 | --- |
| 8 | Duplicate transition components to cover every permitted successor of a |
| 9 | winning marking. The reachable part of this finite strategy construction |
| 10 | is bisimilar to the input system and carries an accepting automaton run. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax369799.CloneGameRun |
| 14 | open TransitionEncoding TransitionSystems UnfoldAutomata ModalAcceptanceGame |
| 15 | |
| 16 | axiom winning_run {P : Type} (M : UnfoldAutomaton (TransitionAlphabet P)) |
| 17 | (hM : BisimAutomata.IsBisimAutomaton M) (S : TransitionSystem P) |
| 18 | (hwin : ParityWinningRegions.Winning (game M S) true |
| 19 | (position M.condition.initial S.initial)) : |
| 20 | ∃ U : RankedSystems.System (TransitionAlphabet P) 0, |
| 21 | Bisimilar (decode U) S ∧ ∃ r : Run M U, r.Accepting |
| 22 | |
| 23 | end Lax369799.CloneGameRun |
| 24 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments