Reversible Truly Concurrent Process Algebra

05/03/2018
by   Yong Wang, et al.
0

We design a reversible version of truly concurrent process algebra CTC which is called RCTC. It has good properties modulo several kinds of strongly forward-reverse truly concurrent bisimulations and weakly forward-reverse truly concurrent bisimulations. These properties include monoid laws, static laws, new expansion law for strongly forward-reverse truly concurrent bisimulations, τ laws for weakly forward-reverse truly concurrent bisimulations, and congruences for strongly and weakly forward-reverse truly concurrent bisimulations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/29/2018

Truly Concurrent Process Algebra Is Reversible

Based on our previous process algebra for concurrency APTC, we prove tha...
research
06/27/2019

Truly Concurrent Bisimilarities are Game Equivalent

We design games for truly concurrent bisimilarities, including strongly ...
research
09/10/2021

Truly Concurrent Process Algebra with Localities

The well-known process algebras, such as CCS, ACP and π-calculus, captur...
research
03/29/2021

Enabling Replications and Contexts in Reversible Concurrent Calculus

Existing formalisms for the algebraic specification and representation o...
research
02/06/2020

Convolution and Concurrency

We show how concurrent quantales and concurrent Kleene algebras arise as...
research
05/26/2021

Implementation of Live Reverse Debugging in LLDB

Debugging is an essential process with a large share of the development ...
research
06/10/2017

Stepwise regression for unsupervised learning

I consider unsupervised extensions of the fast stepwise linear regressio...

Please sign up or login with your details

Forgot password? Click here to reset