pith. sign in

arxiv: 1410.5131 · v7 · pith:JQTIPXOEnew · submitted 2014-10-20 · 💻 cs.LO

An Algebra of Reversible Computation

classification 💻 cs.LO
keywords reversiblealgebrabisimulationsconcurrentforward-reversetrulyabstractionalgebraic
0
0 comments X
read the original abstract

Process algebra ACP based on the interleaving semantics can not be reversed. We design a reversible version of APTC called RAPTC. It has algebraic laws of reversible choice, sequence, parallelism, communication, silent step and abstraction, and also the soundness and completeness modulo strongly forward-reverse truly concurrent bisimulations and weakly forward-reverse truly concurrent bisimulations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.