General reversibility

Danos, V, Krivine, J and Sobocinski, P (2006) General reversibility. In, Express, Bonn, Germany,

WarningThere is a more recent version of this item available.


Full text not available from this repository.


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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Event Dates: 26 August, 2006
Keywords: reversibility, transactions
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science
ePrint ID: 263500
Accepted Date and Publication Date:
Date Deposited: 19 Feb 2007
Last Modified: 27 Mar 2014 20:07
Further Information:Google Scholar

Available Versions of this Item

Actions (login required)

View Item View Item