History-Preserving Bisimulations on Reversible Calculus of Communicating Systems

04/27/2018
by   Clément Aubert, et al.
0

History-and hereditary history-preserving bisimulation (HPB and HHPB) are equivalences relations for denotational models of concurrency. Finding their counterpart in process algebras is an open problem, with some partial successes: there exists in calculus of communicating systems (CCS) an equivalence based on causal trees that corresponds to HPB. In Reversible CSS (RCCS), there is a bisimulation that corresponds to HHPB, but it considers only processes without auto-concurrency. We propose equivalences on CCS with auto-concurrency that correspond to HPB and HHPB, and their so-called "weak" variants. The equivalences exploit not only reversibility but also the memory mechanism of RCCS.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/14/2020

How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation

Reversible computation opens up the possibility of overcoming some of th...
research
06/13/2022

The ℵ-Calculus: A declarative model of reversible programming

A novel model of reversible computing, the ℵ-calculus, is introduced. It...
research
03/29/2021

Enabling Replications and Contexts in Reversible Concurrent Calculus

Existing formalisms for the algebraic specification and representation o...
research
05/14/2020

Structural Equivalences for Reversible Calculi of Communicating Systems (Oral communication)

The formalization of process algebras usually starts with a minimal core...
research
10/25/2021

Causal Consistent Replication in Reversible Concurrent Calculi

Reversible computation is key in developing new, energy-efficient paradi...
research
10/25/2019

CrevNet: Conditionally Reversible Video Prediction

Applying resolution-preserving blocks is a common practice to maximize i...

Please sign up or login with your details

Forgot password? Click here to reset