Truly Concurrent Process Algebra Is Reversible
Yong Wang
TL;DR
This paper demonstrates that a process algebra designed for true concurrency, APTC, can be made reversible with minor modifications, enabling reversible computation in concurrent systems.
Contribution
The authors introduce a reversible extension of APTC, called BARTC and APRTC, incorporating recursion and abstraction for reversible true concurrency.
Findings
APTC is proven reversible with small modifications
Reversible algebra includes BARTC and APRTC components
Supports recursion and abstraction in reversible true concurrency
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Computability, Logic, AI Algorithms · Distributed systems and fault tolerance