Correctness of ranked transition encodings
Lax369799.EncodingTheorems · concepts/Lax369799/EncodingTheorems.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Every finite reachable transition system has a ranked encoding. Ranked bisimilarity coincides with usual bisimilarity of decodings, as asserted by in Section 6.1.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax369799.TransitionEncoding |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Correctness of ranked transition encodings |
| 6 | type: theorem |
| 7 | --- |
| 8 | Every finite reachable transition system has a ranked encoding. Ranked |
| 9 | bisimilarity coincides with usual bisimilarity of decodings, as asserted |
| 10 | by `lemma:bisimulation-is-bisimulation` in Section 6.1. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax369799.EncodingTheorems |
| 14 | open RankedSystems TransitionSystems TransitionEncoding |
| 15 | |
| 16 | axiom encoding_exists {P : Type} (S : TransitionSystem P) : |
| 17 | ∃ T : System (TransitionAlphabet P) 0, decode T = S |
| 18 | |
| 19 | axiom bisimulation_iff {P : Type} (S T : System (TransitionAlphabet P) 0) : |
| 20 | RankedBisimilar S T ↔ Bisimilar (decode S) (decode T) |
| 21 | |
| 22 | end Lax369799.EncodingTheorems |
| 23 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments