Reversing algebraic process calculi

Abstract Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing. We formulate a procedure for converting operators of standard algebraic process calculi such as CCS into reversible operators, while preserving their operational semantics. We define forward–reverse bisimulation and show that it is preserved by all reversible operators.

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

[2]  Robin Milner,et al.  Functions as processes , 1990, Mathematical Structures in Computer Science.

[3]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[4]  Corrado Priami,et al.  Enhanced operational semantics: a tool for describing and analyzing concurrent systems , 2001, CSUR.

[5]  Wojciech Penczek,et al.  Propositional Temporal Logics and Equivalences , 1992, CONCUR.

[6]  Mohammad Reza Mousavi,et al.  Congruence for Structural Congruences , 2005, FoSSaCS.

[7]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[8]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[9]  Jonathan Grattage.  A functional quantum programming language , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

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

[11]  Rocco De Nicola,et al.  A Partial Ordering Semantics for CCS , 1990, Theor. Comput. Sci..

[12]  Harry Buhrman,et al.  Time and Space Bounds for Reversible Simulation , 2001, ICALP.

[13]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[14]  Ilaria Castellani,et al.  Flow Models of Distributed Computations: Three Equivalent Semantics for CCS , 1994, Inf. Comput..

[15]  Rocco De Nicola,et al.  Back and Forth Bisimulations , 1990, CONCUR.

[16]  Ugo Montanari,et al.  Partial ordering derivations for CCS , 1985, FCT.

[17]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

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

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

[20]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[21]  Samson Abramsky,et al.  A Structural Approach to Reversible Computation , 2005, Theor. Comput. Sci..

[22]  Ilaria Castellani,et al.  A non-interleaving semantics for CCS based on proved transitions , 1988 .

[23]  Ilaria Castellani,et al.  Process Algebras with Localities , 2001, Handbook of Process Algebra.