A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours

05/17/2021
by   Xinxin Liu, et al.
0

We present an equational inference system for finite-state expressions, and prove that the system is sound and complete with respect to divergence preserving branching congruence, closing a problem that has been open since 1993. The inference system refines Rob van Glabbeek's simple and elegant complete axiomatisation for branching bisimulation congruence of finite-state behaviours by joining four simple axioms after dropping one axiom which is unsound under the more refined divergence sensitive semantics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/03/2018

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence

We prove that rooted divergence-preserving branching bisimilarity is a c...
research
03/27/2023

Inference Rules for Binary Predicates in a Multigranular Framework

In a multigranular framework, the two most important binary predicates a...
research
08/31/2020

Divergence-Preserving Branching Bisimilarity

This note considers the notion of divergence-preserving branching bisimi...
research
10/30/2018

Dynamic Type Inference for Gradual Hindley--Milner Typing

Garcia and Cimini study a type inference problem for the ITGL, an implic...
research
06/15/2020

Some complete ω-powers of a one-counter language, for any Borel class of finite rank

We prove that, for any natural number n ≥ 1, we can find a finite alphab...
research
08/09/2021

Proof-Theory and Semantics for a Theory of Definite Descriptions

This paper presents a sequent calculus and a dual domain semantics for a...
research
01/26/2021

Dualizing sup-preserving endomaps of a complete lattice

It is argued in (Eklund et al., 2018) that the quantale [L,L] of sup-pre...

Please sign up or login with your details

Forgot password? Click here to reset