Concurrency, Causality and Reversibility: part 1

Irek Ulidowski, Reversing Ccs, Reversible Ccs · 2014

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.

Read the paper · More papers on PaperTik