Pages that link to "Item:Q3569037"
From MaRDI portal
The following pages link to On the proof method for bisimulation (Q3569037):
Displaying 11 items.
- Program constructions that are safe for bisimulation (Q1577351) (← links)
- Decoding choice encodings (Q1854385) (← links)
- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity (Q2119978) (← links)
- A duality in proof systems for recursive type equality and for bisimulation equivalence on cyclic term graphs (Q2843933) (← links)
- Up-to Techniques for Branching Bisimilarity (Q3297777) (← links)
- (Q3765231) (← links)
- (Q4037401) (← links)
- (Q4449205) (← links)
- (Q5155663) (← links)
- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions (Q5458376) (← links)
- Constraints as processes (Q6104383) (← links)