Reversible Communicating Systems

  • Vincent Danos
  • Jean Krivine
Conference paper

DOI: 10.1007/978-3-540-28644-8_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3170)
Cite this paper as:
Danos V., Krivine J. (2004) Reversible Communicating Systems. In: Gardner P., Yoshida N. (eds) CONCUR 2004 - Concurrency Theory. CONCUR 2004. Lecture Notes in Computer Science, vol 3170. Springer, Berlin, Heidelberg


One obtains in this paper a process algebra RCCS, in the style of CCS, where processes can backtrack. Backtrack, just as plain forward computation, is seen as a synchronization and incurs no additional cost on the communication structure. It is shown that, given a past, a computation step can be taken back if and only if it leads to a causally equivalent past.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Vincent Danos
    • 1
  • Jean Krivine
    • 2
  1. 1.Université Paris 7 & CNRSFrance
  2. 2.INRIA RocquencourtFrance

Personalised recommendations