Truly Concurrent Process Algebra Is Reversible
Logic in Computer Science
2018-10-03 v1
Abstract
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.
Cite
@article{arxiv.1810.00868,
title = {Truly Concurrent Process Algebra Is Reversible},
author = {Yong Wang},
journal= {arXiv preprint arXiv:1810.00868},
year = {2018}
}
Comments
43 pages. arXiv admin note: substantial text overlap with arXiv:1611.09035, arXiv:1709.01217