A Lean-Congruence Format for EP-Bisimilarity

08/30/2023
by   Rob van Glabbeek, et al.
0

Enabling preserving bisimilarity is a refinement of strong bisimilarity, which preserves safety as well as liveness properties. To define it properly, labelled transition systems needed to be upgraded with a successor relation, capturing concurrency between transitions enabled in the same state. We enrich the well-known De Simone format to handle inductive definitions of this successor relation. We then establish that ep-bisimilarity is a congruence for the operators, as well as lean congruence for recursion, for all (enriched) De Simone languages.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/31/2019

Justness: A Completeness Criterion for Capturing Liveness Properties

This paper poses that transition systems constitute a good model of dist...
research
04/13/2023

A Declarative Validator for GSOS Languages

Rule formats can quickly establish meta-theoretic properties of process ...
research
08/19/2019

Divide and Congruence III: From Decomposition of Modal Formulas to Preservation of Stability and Divergence

In two earlier papers we derived congruence formats with regard to trans...
research
02/09/2018

Opacity of nondeterministic transition systems: A (bi)simulation relation approach

In this paper, we propose several opacity-preserving (bi)simulation rela...
research
07/30/2021

On Strong Observational Refinement and Forward Simulation

Hyperproperties are correctness conditions for labelled transition syste...
research
09/24/2019

A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems

Branching bisimilarity is a behavioural equivalence relation on labelled...
research
09/06/2022

Bisimulations Respecting Duration and Causality for the Non-interleaving Applied π-Calculus

This paper shows how we can make use of an asynchronous transition syste...

Please sign up or login with your details

Forgot password? Click here to reset