Up-to techniques for weak bisimulation
From MaRDI portal
Recommendations
Cited in
(16)- Congruent weak bisimulation with dense real-time
- Distinguishing and relating higher-order and first-order processes by expressiveness
- Bisimulation and coinduction enhancements: a historical perspective
- New up-to techniques for weak bisimulation
- Bisimulations up-to: beyond first-order transition systems
- Up-to techniques for branching bisimilarity
- Beyond Bisimulation: The “up-to” Techniques
- On Bisimulation Proofs for the Analysis of Distributed Abstract Machines
- Up-to techniques for generalized bisimulation metrics
- Tower induction and up-to techniques for CCS with fixed points
- Lax bialgebras and up-to techniques for weak bisimulations
- Weak Bisimulation Up to Elaboration
- Bisimulation verification using the up to techniques
- Preorder-constrained simulations for program refinement with effects
- An efficient abstract machine for safe ambients
- Using bisimulation proof techniques for the analysis of distributed abstract machines
This page was built for publication: Up-to techniques for weak bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716822)