Truly Concurrent Process Algebra Is Reversible

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.

[1]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[2]  Wan Fokkink,et al.  Introduction to Process Algebra , 1999, Texts in Theoretical Computer Science. An EATCS Series.

[3]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[4]  Yong Wang.  An algebra of reversible computation , 2016, SpringerPlus.

[5]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[6]  Yong Wang.  A Calculus for True Concurrency. , 2017 .

[7]  Yong Wang.  Reversible Truly Concurrent Process Algebra , 2018, ArXiv.

[8]  Yong Wang.  Algebraic Laws for True Concurrency , 2016, ArXiv.