One of the well-known results in concurrency theory con-cerns the relationship between event structures and occurrence nets: anoccurrence net can be associated with a prime event structure, and viceversa. More generally, the relationships between various forms of eventstructures and suitable forms of nets have been long established. Goodexamples are the close relationship between inhibitor event structuresand inhibitor occurrence nets, or between asymmetric event structuresand asymmetric occurrence nets. Several forms of event structures suitedfor the modelling of reversible computation have recently been developed;also a method for reversing occurrence nets has been proposed. This pa-per bridges the gap between reversible event structures and reversiblenets. We introduce the notion of reversible occurrence net, which is ageneralisation of the notion of reversible unfolding. We show that re-versible occurrence nets correspond precisely to a subclass of reversibleprime event structures, the causal reversible prime event structures.