Reversibility and Models for Concurrency

There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS [2] and CCSK [8] were developed and general techniques for reversing other process operators were proposed. The paper shows that the notion of reversibility can bridge the gap between some interleaving models and non-interleaving models of concurrency, and makes them interchangeable. We prove that transition systems associated with reversible process algebras are equivalent as models to labelled prime event structures. Furthermore, we show that forward-reverse bisimulation corresponds to hereditary history-preserving bisimulation in the setting with no auto-concurrency and no auto-causation.

• Type: Journal
• Year: 2007
• Where: ENTCS
• Authors: Iain Phillips, Irek Ulidowski
• Keywords: ENTCS 2007, Reversible Computation, Reversible Process, Reversible Process Algebras