General reversibility


Danos, V, Krivine, J and Sobocinski, P (2006) General reversibility. In, 13th International Workshop on Expressiveness in Concurrency, Express '06, Bonn, Germany,

This is the latest version of this item.

Download

Full text not available from this repository.

Description/Abstract

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 > Electronic & Software Systems
ePrint ID: 263507
Date Deposited: 19 Feb 2007
Last Modified: 27 Mar 2014 20:07
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/263507

Available Versions of this Item

Actions (login required)

View Item View Item