Reversible Communicating Systems

Vincent Danos, Jean Krivine

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publicationCONCUR 2004 - Concurrency Theory
Subtitle of host publication15th International Conference, London, UK, August 31 - September 3, 2004. Proceedings
EditorsPhilippa Gardner, Nobuko Yoshida
PublisherSpringer Berlin Heidelberg
Pages292-307
Number of pages16
Volume3170
ISBN (Electronic)978-3-540-28644-8
ISBN (Print)978-3-540-22940-7
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume3170

Fingerprint

Dive into the research topics of 'Reversible Communicating Systems'. Together they form a unique fingerprint.

Cite this