Concurrency, Causality and Reversibility: part 2

Usually computation goes forward only P → Q But sometimes reversible computation P ↔ Q can be helpful: Landauer (1961): irreversibility generates heat; logical (ir)reversibility. Danos and Krivine (2003-2005): Reversible CCS; biological systems. Gluck and Yokoyama (2007): reversible programming language. Phillips, Ulidowski, Yuen (2006-now): reversibility in concurrency. Lanese, Krivine, Stefani: reversible π and higher-order π. Laneve and Cardelli: reversible asynchronous process calculus.

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

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

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

[4]  Irek Ulidowski,et al.  Reversibility and asymmetric conflict in event structures , 2015, J. Log. Algebraic Methods Program..

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