Transition Systems from Asymmetric Prime Event Structures with Cause-Respecting Reversibility

In the literature, two structurally different approaches to associating transition system semantics with event structure models have been distinguished. One approach is based on configurations, which are sets of already executed events. The other approach is based on model residuals, which are not yet executed fragments of the model. Configuration-based transition systems appear to be primarily used for representing the semantics of event structures. Residual-based transition systems are actively applied to demonstrate the consistency between operational and denotational semantics of concurrent process calculi and to visualize models dynamics. Reversible computing is a novel paradigm that has recently emerged and extends traditional forwards-only computation with the capability to execute in the reverse direction, making it possible for computation to run backwards as well as forwards. The present paper focuses on prime event structures extended with asymmetric conflict and causality-respecting reversibility. Two types of transition system semantics are constructed, and their pairwise bisimilarity is proven.