Bisimulation and Co-induction: Some Problems

DOI10.1016/J.ENTCS.2005.12.099zbMATH Open1316.68107OpenAlexW1969657822MaRDI QIDQ5262977FDOQ5262977

Davide Sangiorgi

Publication date: 10 July 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2005.12.099

zbMATH Keywords

congruencebisimulationup-to techniqueshigher-order languages

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Bisimulation for higher-order process calculi
• A calculus for cryptographic protocols: The spi calculus
• Contextual equivalence for higher-order \(\pi\)-calculus revisited
• Proving congruence of bisimulation in functional programming languages
• On the bisimulation proof method
• The \(\pi\)-calculus: A theory of mobile processes
• On reduction-based process semantics
• Barbed bisimulation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bisimulation congruences in safe ambients
• From rewrite rules to bisimulation congruences

Cited In (4)

• Title not available (Why is that?)
• From bisimulation to simulation: Coarsest partition problems
• Bisimulation can't be traced
• New Bisimulation Semantics for Distributed Systems

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)