Bisimulation and co-induction: some problems
From MaRDI portal
Recommendations
Cites work
- A calculus for cryptographic protocols: The spi calculus
- Barbed bisimulation
- Bisimulation congruences in safe ambients
- Bisimulation for higher-order process calculi
- Contextual equivalence for higher-order -calculus revisited
- From rewrite rules to bisimulation congruences
- scientific article; zbMATH DE number 4104403 (Why is no real title available?)
- scientific article; zbMATH DE number 1251177 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- On reduction-based process semantics
- On the bisimulation proof method
- Proving congruence of bisimulation in functional programming languages
- The -calculus: A theory of mobile processes
Cited in
(6)- From bisimulation to simulation: Coarsest partition problems
- Bisimulation and coinduction enhancements: a historical perspective
- Introduction to bisimulation and coinduction
- scientific article; zbMATH DE number 6115908 (Why is no real title available?)
- New Bisimulation Semantics for Distributed Systems
- Bisimulation can't be traced
This page was built for publication: Bisimulation and co-induction: some problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262977)