Up-to Techniques for Branching Bisimilarity

DOI10.1007/978-3-030-38919-2_24zbMath1440.68176arXiv2001.08944OpenAlexW3102696791MaRDI QIDQ3297777

Rick Erkens, Jurriaan Rot, Bas Luttik

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.08944

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Combining semilattices and semimodules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general account of coinduction up-to
• On cool congruence formats for weak bisimulations
• Structural operational semantics for weak bisimulations
• A complete axiomatisation for observational congruence of finite-state behaviours
• An efficiency preorder for processes
• Universal coalgebra: A theory of systems
• Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• New up-to techniques for weak bisimulation
• Introduction to Coalgebra
• Weak bisimulation for coalgebras over order enriched monads
• On the proof method for bisimulation
• Bisimulation can't be traced
• Coinduction All the Way Up
• Enhancements of the bisimulation proof method

This page was built for publication: Up-to Techniques for Branching Bisimilarity