Reversible Communicating Systems
- 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.