DeepAI AI Chat
Log In Sign Up

Up-to Techniques for Branching Bisimilarity

by   Rick Erkens, et al.

Ever since the introduction of behavioral equivalences on processes one has been searching for efficient proof techniques that accompany those equivalences. Both strong bisimilarity and weak bisimilarity are accompanied by an arsenal of up-to techniques: enhancements of their proof methods. For branching bisimilarity, these results have not been established yet. We show that a powerful proof technique is sound for branching bisimilarity by combining the three techniques of up to union, up to expansion and up to context for Bloom's BB cool format. We then make an initial proposal for casting the correctness proof of the up to context technique in an abstract coalgebraic setting, covering branching but also η, delay and weak bisimilarity.


page 1

page 2

page 3

page 4


Proving Soundness of Extensional Normal-Form Bisimilarities

Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence...

Abstract Congruence Criteria for Weak Bisimilarity

We introduce three general compositionality criteria over operational se...

Glueability of resource proof-structures: inverting the Taylor expansion (long version)

A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be ...

Gluing resource proof-structures: inhabitation and inverting the Taylor expansion

A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be ...

Goal-Oriented Conjecturing for Isabelle/HOL

We present PGT, a Proof Goal Transformer for Isabelle/HOL. Given a proof...

Integrating Owicki-Gries for C11-Style Memory Models into Isabelle/HOL

Weak memory presents a new challenge for program verification and has re...

A new convergence proof for approximations of the Stefan problem

We consider the Stefan problem, firstly with regular data and secondly w...