An Algebra of Reversible Computation
Logic in Computer Science
2018-05-03 v7
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.
Cite
@article{arxiv.1410.5131,
title = {An Algebra of Reversible Computation},
author = {Yong Wang},
journal= {arXiv preprint arXiv:1410.5131},
year = {2018}
}
Comments
74 pages