Ranking a functional bisimulation
Lax369799.RankedLifting · concepts/Lax369799/RankedLifting.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
A functional bisimulation between finite transition systems can be represented by a ranked system morphism. Directions enumerate target successors with enough repeated copies to cover every source successor. Forgetting the directions recovers the original transition systems.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.BisimulationQuotient |
| 2 | import Lax369799.TransitionEncoding |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Ranking a functional bisimulation |
| 7 | type: theorem |
| 8 | --- |
| 9 | A functional bisimulation between finite transition systems can be |
| 10 | represented by a ranked system morphism. Directions enumerate target |
| 11 | successors with enough repeated copies to cover every source successor. |
| 12 | Forgetting the directions recovers the original transition systems. |
| 13 | -/ |
| 14 | namespace Lax369799.RankedLifting |
| 15 | open RankedSystems Morphisms TransitionSystems TransitionEncoding BisimulationQuotient |
| 16 | |
| 17 | axiom map_lift {P : Type} (S T : TransitionSystem P) (f : SystemMap S T) : |
| 18 | ∃ (R U : System (TransitionAlphabet P) 0), decode R = S ∧ decode U = T ∧ |
| 19 | Nonempty (Morphism R.val U.val) |
| 20 | |
| 21 | end Lax369799.RankedLifting |
| 22 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments