Truly Concurrent Process Algebra Is Reversible

09/29/2018
by   Yong Wang, et al.
0

Based on our previous process algebra for concurrency APTC, we prove that it is reversible with a little modifications. The reversible algebra has four parts: Basic Algebra for Reversible True Concurrency (BARTC), Algebra for Parallelism in Reversible True Concurrency (APRTC), recursion and abstraction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2018

Reversible Truly Concurrent Process Algebra

We design a reversible version of truly concurrent process algebra CTC w...
research
12/07/2022

revTPL: The Reversible Temporal Process Language

Reversible debuggers help programmers to find the causes of misbehaviour...
research
10/30/2021

Non-reversible processes: GENERIC, Hypocoercivity and fluctuations

We consider two approaches to study non-reversible Markov processes, nam...
research
03/29/2021

Enabling Replications and Contexts in Reversible Concurrent Calculus

Existing formalisms for the algebraic specification and representation o...
research
03/14/2022

On the Skolem Problem for Reversible Sequences

Given an integer linear recurrence sequence ⟨ X_n ⟩_n, the Skolem Proble...
research
03/21/2019

Irreversible Langevin MCMC on Lie Groups

It is well-known that irreversible MCMC algorithms converge faster to th...
research
06/18/2018

Lambda-calculus and Reversible Automatic Combinators

In 2005, Abramsky introduced various linear/affine combinatory algebras ...

Please sign up or login with your details

Forgot password? Click here to reset