Reversible computation has attracted increasing interest in recen
t years, with
applications in hardware, software and biochemistry. We introduce
reversible
forms of prime event structures and asymmetric event structur
es. In order to
control the manner in which events are reversed, we use asymmet
ric conflict
on events. We prove a number of results about reachable configur
ations; for
instance, we show under what conditions reachable configurations
which are
finite are reachable by purely finite means. We discuss, with examples
, reversing
in causal order, where an event is only reversed once all events it c
aused have
been reversed, as well as forms of non-causal reversi