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, ACP and CSP into reversible operators, while preserving their operational semantics.


Transition Relation Operational Semantic Choice Rule Past Action Forward Transition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Abramsky, S.: A structural approach to reversible computation. Theoretical Computer Science 347(3), 441–464 (2005)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Altenkirch, T., Grattage, J.: A functional quantum programming language. In: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science, LICS 2005, pp. 249–258. IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
  3. 3.
    Baeten, J.C.M., Verhoef, C.: A congruence theorem for structured operational semantics with predicates. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 477–492. Springer, Heidelberg (1993)Google Scholar
  4. 4.
    Baeten, J.C.M., Weijland, W.P.: Process Algebra. In: Cambridge Tracts in Theoretical Computer Science, vol. 18, Cambridge University Press, Cambridge (1990)Google Scholar
  5. 5.
    Bednarczyk, M.A.: Hereditary history preserving bisimulations or what is the power of the future perfect in program logics. Technical report, Institute of Computer Science, Polish Academy of Sciences, Gdańsk (1991)Google Scholar
  6. 6.
    Boudol, G., Castellani, I.: Flow models of distributed computations: three equivalent semantics for CCS. Information and Computation 114, 247–314 (1994)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Buhrman, H., Tromp, J., Vitányi, P.: Time and space bounds for reversible simulation. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 1017–1027. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Danos, V., Krivine, J.: Formal molecular biology done in CCS-R. In: Proceedings of BioConcur, Marseille (2003)Google Scholar
  9. 9.
    Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292–307. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Danos, V., Krivine, J.: Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 398–412. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    De Nicola, R., Montanari, U., Vaandrager, F.: Back and forth bisimulations. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 152–165. Springer, Heidelberg (1990)Google Scholar
  12. 12.
    van Glabbeek, R.J., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37, 229–327 (2001)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Goltz, U., Kuiper, R., Penczek, W.: Propositional temporal logics and equivalences. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 222–235. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  14. 14.
    Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)MATHGoogle Scholar
  15. 15.
    Landauer, R.: Irreversibility and heat generated in the computing process. IBM Journal of Research and Development 5, 183–191 (1961)CrossRefMATHGoogle Scholar
  16. 16.
    Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)MATHGoogle Scholar
  17. 17.
    Mousavi, M.R., Reniers, M.A.: Congruence for structural congruences. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 47–62. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  18. 18.
    Phillips, I.C.C., Ulidowski, I.: Reversing algebraic process calculi. Technical Report CS-06-01, Department of Computer Science, Leicester University (2006)Google Scholar
  19. 19.
    Plotkin, G.D.: A structural approach to operational semantics. Journal of Logic and Algebraic Programming, 60–61,17–139 (2004)Google Scholar
  20. 20.
    Virtutech. Simics Hindsight (2005),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Iain Phillips
    • 1
  • Irek Ulidowski
    • 2
  1. 1.Department of ComputingImperial College LondonEngland
  2. 2.Department of Computer ScienceUniversity of LeicesterEngland

Personalised recommendations