Output details

A hierarchy of reverse bisimulations on stable configuration structures

<10>This paper provides the first comprehensive hierarchy of over thirty bisimulation relations in the setting of reversible concurrent computation. These bisimulations are potential candidates for, and a good starting point for future research on, meaningful and practically useful behavioural equivalences for reversibility (recognised by Cristescu et al [LICS'13] as an important open problem). Recently, reversible bisimulations have been used in the analysis of recoverable fault-tolerant systems (ARN-funded project REVER in France). Other potential applications include transactions with compensations, quantum processes and biochemical reactions. We also answer in negative a long-standing open problem of Bednarczyk regarding step bisimulation with reverse steps.