Reversible computing allows one to execute programs both in the standard, forward
direction, and backward, going back to past states. In a concurrent scenario, the correct …

The notion of reversible computation is attracting increasing interest because of its
applications in diverse fields, in particular the study of programming abstractions for reliable …

Reversible computation allows computation to proceed not only in the standard, forward
direction, but also backward, recovering past states. While reversible computation has …

Reversible computation has attracted increasing interest in recent years, with applications in
hardware, software and biochemistry. We introduce reversible forms of prime event …

We explore the complexity of reachability and run-time refinement under safety and liveness
constraints in event-based process models. Our study is framed in the DCR^ ⋆⋆ process …

The notion of reversible computing is attracting interest because of its applications in diverse
fields, in particular the study of programming abstractions for fault tolerant systems. Most …

Reversible computation is an unconventional form of computing where any executed
sequence of operations can be executed in reverse at any point during computation. In this …

Petri nets are a well-known model of concurrency and provide an ideal setting for the study
of fundamental aspects in concurrent systems. Despite their simplicity, they still lack a …

Rollback is a fundamental technique for ensuring reliability of systems, allowing one, in case
of troubles, to recover a past system state. However, the definition of rollback in a …

Causal reversibility blends reversibility and causality for concurrent systems. It indicates that
an action can be undone provided that all of its consequences have been undone already …