  One of the well-known results in concurrency theory concerns the relationship
between event structures and occurrence nets: an occurrence net can be
associated with a prime event structure, and vice versa. More generally, the
relationships between various forms of event structures and suitable forms of
nets have been long established. Good examples are the close relationship
between inhibitor event structures and inhibitor occurrence nets, or between
asymmetric event structures and asymmetric occurrence nets. Several forms of
event structures suited for the modelling of reversible computation have
recently been developed; also a method for reversing occurrence nets has been
proposed. This paper bridges the gap between reversible event structures and
reversible nets. We introduce the notion of reversible causal net, which is a
generalisation of the notion of reversible unfolding. We show that reversible
causal nets correspond precisely to a subclass of reversible prime event
structures, the causal reversible prime event structures.
