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

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 …

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 …

Reversible debuggers help programmers to quickly find the causes of misbehaviours in
concurrent programs. These debuggers can be founded on the well-studied theory of causal …

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 …

We introduce a method of reversing the execution of imperative concurrent programs. Given
an irreversible program, we describe the process of producing two versions. The first …

Existing formalisms for the algebraic specification and representation of networks of
reversible agents suffer some shortcomings. Despite multiple attempts, reversible …

This article designs a general principle to check the correctness of the definition of
concurrency (aka independence) of events for concurrent calculi. Concurrency relations are …

Abstract Causal nets (CNs) are Petri nets where causal dependencies are modelled via
inhibitor arcs. They play the role of occurrence nets when representing the behaviour of a …

The algebraic specification and representation of networks of agents have been greatly
impacted by the study of reversible phenomena: reversible declensions of the calculus of …