Iain Phillips, Irek Ulidowski
Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing. We discuss reversibility in major process algebras from the point of view of operational semantics. The main difficulty seems to be with the definitions of forward and reverse computation for the dynamic operators, and we confine ourselves to these, leaving the static operators for further work. We consider a solution where predicates in SOS rules play a vital role.
pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.