Handbook of Truly Concurrent Process Algebra

Chapter 6: Algebraic laws for partially reversible computing

Abstract

This chapter introduces an axiomatization of partially reversible computing.

Keywords

Reversible Computing; Axiomatization; Algebraic Theory

Based on APTC, we also did some work on reversible algebra called RAPTC. However, the axiomatization of RAPTC is imperfect, it is sound, but not complete. The main reason for this is that the existence of a multichoice operator makes a sound and complete axiomatization cannot be established. In this chapter, we try to use an alternative operator to replace a multichoice operator and we obtain a sound and complete axiomatization for reversible computing. The main reason for using an alternative operator is that when an alternative branch is ...