@inproceedings{60975f7801ba43c9b7abfc0f4097e725,
title = "Reversible Communicating Systems",
abstract = "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.",
author = "Vincent Danos and Jean Krivine",
year = "2004",
doi = "10.1007/978-3-540-28644-8_19",
language = "English",
isbn = "978-3-540-22940-7",
volume = "3170",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "292--307",
editor = "Philippa Gardner and Nobuko Yoshida",
booktitle = "CONCUR 2004 - Concurrency Theory",
address = "United Kingdom",
}