Reversible Communicating Systems [chapter]

Vincent Danos, Jean Krivine
2004 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-540-28644-8_19 fatcat:47k5b7qcwjfjjlaiaplun3fr4a