Concurrency and Reversibility

Reversible computation has attracted increasing interest in recent years, with applications in hardware, software and biochemistry. In this paper we show how to model reversibility in concurrent computation as realised abstractly in terms of event structures. Two different forms of event structures are presented and it is shown how to extend them with reversibility.

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

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

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

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

[5]  Daniele Varacca,et al.  A Compositional Semantics for the Reversible p-Calculus , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

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

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

[8]  Vincent Danos,et al.  Formal Molecular Biology Done in CCS-R , 2007, Electron. Notes Theor. Comput. Sci..

[9]  Paul Gastin,et al.  CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings , 2010, CONCUR.

[10]  Ivan Lanese,et al.  Controlled Reversibility and Compensations , 2012, RC.

[11]  Irek Ulidowski,et al.  Event Identifier Logic† , 2013, Mathematical Structures in Computer Science.

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

[13]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[14]  Jan Kratochvíl,et al.  Mathematical Foundations of Computer Science 2004 , 2004, Lecture Notes in Computer Science.

[15]  Ursula Goltz,et al.  Refinement of actions and equivalence notions for concurrent systems , 2001, Acta Informatica.

[16]  Perdita Stevens,et al.  Modelling Recursive Calls with UML State Diagrams , 2003, FASE.

[17]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[18]  Ivan Lanese,et al.  Reversing Higher-Order Pi , 2010, CONCUR.

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

[20]  Parosh Aziz Abdulla,et al.  Advanced Ramsey-Based Büchi Automata Inclusion Testing , 2011, CONCUR.

[21]  Ivan Lanese,et al.  Controlling Reversibility in Higher-Order Pi , 2011, CONCUR.

[22]  Glynn Winskel,et al.  Events, Causality and Symmetry , 2008, Comput. J..

[23]  Daniele Varacca,et al.  Typed event structures and the linear pi-calculus , 2010, Theor. Comput. Sci..

[24]  Irek Ulidowski,et al.  Modelling of Bonding with Processes and Events , 2013, RC.

[25]  Cosimo Laneve,et al.  Reversible structures , 2011, CMSB.

[26]  Grzegorz Rozenberg,et al.  Advances in Petri Nets 1985 , 1985, Lecture Notes in Computer Science.

[27]  Irek Ulidowski,et al.  A hierarchy of reverse bisimulations on stable configuration structures , 2012, Mathematical Structures in Computer Science.

[28]  Gordon D. Plotkin,et al.  Event Structures for Resolvable Conflict , 2004, MFCS.

[29]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[30]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.