Bisimulation under ranked decoding
Lax369799.RankedBisimulation · concepts/Lax369799/RankedBisimulation.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Ordinary bisimilarity is an equivalence relation. Ranked unfolding and isomorphism of decodings both preserve it, so the equivalence generated by these operations implies ordinary bisimilarity after decoding.
Concept map
Evidence
This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.
1 bisimilarity_equivalence proven
2 ranked_forward proven
Lean source view on GitHub
| 1 | import Lax369799.TransitionEncoding |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Bisimulation under ranked decoding |
| 6 | type: theorem |
| 7 | --- |
| 8 | Ordinary bisimilarity is an equivalence relation. Ranked unfolding and |
| 9 | isomorphism of decodings both preserve it, so the equivalence generated |
| 10 | by these operations implies ordinary bisimilarity after decoding. |
| 11 | -/ |
| 12 | namespace Lax369799.RankedBisimulation |
| 13 | open RankedSystems TransitionSystems TransitionEncoding |
| 14 | |
| 15 | axiom bisimilarity_equivalence (P : Type) : Equivalence (@Bisimilar P) |
| 16 | |
| 17 | axiom ranked_forward {P : Type} (S T : System (TransitionAlphabet P) 0) |
| 18 | (h : RankedBisimilar S T) : Bisimilar (decode S) (decode T) |
| 19 | |
| 20 | end Lax369799.RankedBisimulation |
| 21 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments