We describe an event-style (or poset) semantics for conflict-free rewrite systems, including term and graph rewriting (possibly with bound variables), the ?-calculus, and other stable transition systems with a residual relation. Our interpretation is based on considering redex-families as events. It treats permutation-equivalent reductions as representing the same concurrent computation. Due to erasure of redexes, event structures are inadequate for such an interpretation. We therefore extend the prime event structure model in two different but equivalent ways: by axiomatizing permutation-equivalence on finite configurations, and by axiomatizing the erasure of events, for the conflict-free case, and show that these extended models are equivalent to stable transition models with axiomatized residual and family relations. We then construct finitary prime algebraic domains from the set of configurations in these extended models by defining orderings relative to stable sets of ‘results’. All useful sets of results for which the normalization (by neededness) theorem can be proved are stable.