Reversible Truly Concurrent Process Algebra
Logic in Computer Science
2018-05-10 v1
Abstract
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, \tau laws for weakly forward-reverse truly concurrent bisimulations, and congruences for strongly and weakly forward-reverse truly concurrent bisimulations.
Keywords
Cite
@article{arxiv.1805.03575,
title = {Reversible Truly Concurrent Process Algebra},
author = {Yong Wang},
journal= {arXiv preprint arXiv:1805.03575},
year = {2018}
}
Comments
40 pages. arXiv admin note: substantial text overlap with arXiv:1410.5131, arXiv:1611.09035, arXiv:1703.00159