Get full access to Handbook of Truly Concurrent Process Algebra and 60K+ other titles, with a free 10-day trial of O'Reilly.

There are also live events, courses curated by job role, and more.

Start your free trial

Chapter 4: Algebraic laws for reversible computing

Abstract

This chapter introduces an axiomatization of fully reversible computing.

Keywords

Reversible Computing; Axiomatization; Algebraic Theory

We found algebraic laws for true concurrency called $A P T C$ [9], we now design a reversible version of $A P T C$ called $R A P T C$ . This chapter is organized as follows. We introduce Basic Reversible Algebra for True Concurrency ( $B R A T C$ ) in Section 4.1, Reversible Algebra for ...

Get Handbook of Truly Concurrent Process Algebra now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial

Don’t leave empty-handed

Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.

It’s yours, free.

Get it now

Check it out now on O’Reilly

Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.

Start your free trial Become a member now