Up-to Techniques for Branching Bisimilarity

01/24/2020
by   Rick Erkens, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/31/2017

Proving Soundness of Extensional Normal-Form Bisimilarities

Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence...
10/15/2020

Abstract Congruence Criteria for Weak Bisimilarity

We introduce three general compositionality criteria over operational se...
10/17/2019

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

A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be ...
08/06/2020

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

A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be ...
06/12/2018

Goal-Oriented Conjecturing for Isabelle/HOL

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

Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network

By proving a strong converse, we strengthen the weak converse result by ...
05/27/2011

Cooperation between Top-Down and Bottom-Up Theorem Provers

Top-down and bottom-up theorem proving approaches each have specific adv...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.