Reversibility in Massive Concurrent Systems

Reversing a (forward) computation history means undoing the history. In concurrent systems, undoing the history is not performed in a deterministic way but in a causally consistent fashion, where states that are reached during a backward computation are states that could have been reached during the computation history by just performing independent actions in a different order.

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

[2]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

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

[4]  Cosimo Laneve,et al.  Smooth Orchestrators , 2006, FoSSaCS.

[5]  Lulu Qian,et al.  A Simple DNA Gate Motif for Synthesizing Large-Scale Circuits , 2008, DNA.

[6]  D. Gillespie.  Exact Stochastic Simulation of Coupled Chemical Reactions , 1977 .

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

[8]  Luca Cardelli.  Two-domain DNA strand displacement , 2013, Math. Struct. Comput. Sci..

[9]  Luca Cardelli.  Strand Algebras for DNA Computing , 2009, DNA.

[10]  Irek Ulidowski,et al.  Reversibility and Models for Concurrency , 2007, Electron. Notes Theor. Comput. Sci..

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

[12]  D. Y. Zhang,et al.  Control of DNA strand displacement kinetics using toehold exchange. , 2009, Journal of the American Chemical Society.

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

[14]  Jean-Jacques Lévy,et al.  An Algebraic Interpretation of the lambda beta K-Calculus; and an Application of a Labelled lambda -Calculus , 1976, Theor. Comput. Sci..

[15]  Cédric Fournet,et al.  The reflexive CHAM and the join-calculus , 1996, POPL '96.

[16]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[17]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[18]  Benjamin C. Pierce,et al.  Decoding Choice Encodings , 2000, Inf. Comput..

[19]  Ilaria Castellani,et al.  Permutation of transitions: An event structure semantics for CCS and SCCS , 1988, REX Workshop.