Weak Bisimulation Up to Elaboration

DOI10.1007/11817949_26zbMATH Open1151.68551OpenAlexW2126470406MaRDI QIDQ5756594FDOQ5756594

Authors: Damien Pous 

Publication date: 4 September 2007

Published in: CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11817949_26

Recommendations

• Automata, Languages and Programming
• New up-to techniques for weak bisimulation
• Lax bialgebras and up-to techniques for weak bisimulations
• Beyond Bisimulation: The “up-to” Techniques
• Coalgebraic bisimulation-up-to

Mathematics Subject Classification ID

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

Cited In (8)

• Bisimulation and coinduction enhancements: a historical perspective
• (Bi)simulations up-to characterise process semantics
• Mechanized metatheory revisited
• Tower induction and up-to techniques for CCS with fixed points
• New up-to techniques for weak bisimulation
• Complete Lattices and Up-To Techniques
• BISON instantiating the whitened swap-or-not construction
• Automata, Languages and Programming

This page was built for publication: Weak Bisimulation Up to Elaboration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756594)