feat: Bisimilarity can be characterized through symmetric simulation relations #273
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
In formalized proofs, the characterization of bisimilarity through symmetric simulations often is more convenient than the one through bisimulation relations. (The reason is that paper proofs about bisimulation often say “the converse case is analogous,” which is not possible in proof assistants. The background usually is that the witness simulation is symmetric or can easily be adapted to be symmetric, which can usually be handled conveniently in a proof assistant.)
Being about alternative characterizations of bisimilarity notions, the PR also proposes to remove the
SWBisimilarityrelation and only seeSWBisimulationas an alternative characterization mechanism forWeakBisimilarity. The thought behind this is that there usually are many ways of characterizing the same notion of equivalence. Especially the weak spectrum has rich aliasing of notions, e.g. with a range of different definitions all leading to the same branching bisimilarity relation. It seems impractical to grant each equivalent definition its own relation symbol.Also, some proofs are shortened a bit using
grind.