General Reversibility

Vincent Danos, Jean Krivine, Pawel Sobociski

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

The first and the second author introduced reversible CCS (RCCS) in order to model concurrent computations where certain actions are allowed to be reversed. Here we show that the core of the construction can be analysed at an abstract level, yielding a theorem of pure category theory which underlies the previous results. This opens the way to several new examples; in particular we demonstrate an application to Petri nets.
Original languageEnglish
Pages (from-to)75-86
Number of pages12
JournalElectronic Notes in Theoretical Computer Science
Issue number3
Publication statusPublished - Jun 2007

Keywords / Materials (for Non-textual outputs)

  • CCS
  • Petri net
  • Reversible computation
  • reversible calculus of communicating systems (RCCS)


Dive into the research topics of 'General Reversibility'. Together they form a unique fingerprint.

Cite this