Reversible Causal Nets and Reversible Event Structures

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.

[1]  Ivan Lanese,et al.  Reversibility in the higher-order π-calculus , 2016, Theor. Comput. Sci..

[2]  Irek Ulidowski,et al.  A Calculus for Local Reversibility , 2016, RC.

[3]  Ivan Lanese,et al.  Causal-Consistent Reversible Debugging , 2014, FASE.

[4]  Gérard Boudol.  Flow Event Structures and Flow Nets , 1990, Semantics of Systems of Concurrent Processes.

[5]  Jean-Bernard Stefani,et al.  Checkpoint/Rollback vs Causally-Consistent Reversibility , 2018, RC.

[6]  Nobuko Yoshida,et al.  Towards a categorical representation of reversible event structures , 2019, J. Log. Algebraic Methods Program..

[7]  Vincent Danos,et al.  Transactions in RCCS , 2005, CONCUR.

[8]  Ivan Lanese,et al.  Causal-Consistent Replay Debugging for Message Passing Programs , 2019, FORTE.

[9]  G. Michele Pinna,et al.  Domain and event structure semantics for Petri nets with read and inhibitor arcs , 2004, Theor. Comput. Sci..

[10]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[11]  Francesca Rossi,et al.  Contextual nets , 1995, Acta Informatica.

[12]  Claudio Antares Mezzina,et al.  Reversing P/T Nets , 2019, COORDINATION.

[13]  Anna Philippou,et al.  Reversible Computation in Petri Nets , 2018, RC.

[14]  Irek Ulidowski,et al.  Reversibility and Asymmetric Conflict in Event Structures , 2013, CONCUR.

[15]  Gordon D. Plotkin,et al.  Configuration structures, event structures and Petri nets , 2009, Theor. Comput. Sci..

[16]  Ivan Lanese,et al.  Concurrent Flexible Reversibility , 2013, ESOP.

[17]  Maciej Koutny,et al.  Reversing Steps in Petri Nets , 2019, Petri Nets.

[18]  Ugo Montanari,et al.  Contextual Petri Nets, Asymmetric Event Structures, and Processes , 2001, Inf. Comput..

[19]  Irek Ulidowski,et al.  A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway , 2012, RC.

[20]  Ivan Lanese,et al.  Causal-Consistent Reversibility , 2014, Bull. EATCS.

[21]  G. Michele Pinna,et al.  Flow Unfolding of Multi-clock Nets , 2014, Petri Nets.

[22]  Iain C. C. Phillips,et al.  Reversing algebraic process calculi , 2007, J. Log. Algebraic Methods Program..

[23]  Rom Langerak,et al.  Bundle event structures: a non-interleaving semantics for LOTOS , 1992, FORTE.

[24]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[25]  G. Michele Pinna,et al.  Lending Petri nets , 2015, Sci. Comput. Program..

[26]  Irek Ulidowski,et al.  Reversing Event Structures , 2018, New Generation Computing.

[27]  G. Michele Pinna,et al.  Petri nets and dynamic causality for service-oriented computations , 2017, SAC.