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 and Applied Science > Electronics and Computer Science > Electronic & Software Systems |
| Item ID: | 263507 |
| Date Deposited: | 19 Feb 2007 |
| Last Modified: | 02 Mar 2012 13:20 |
| Contributors: | Danos, V (Author) Krivine, J (Author) Sobocinski, P (Author) Amadio, R (Editor) Phillips, I (Editor) |
| Date: | 2006 |
| Additional Information: | Event Dates: 26 August, 2006 |
| Status: | Published |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/263507 |
Available Versions of this Item
-
General reversibility. (deposited 19 Feb 2007)
- General reversibility. (deposited 19 Feb 2007) [Currently Displayed]
Actions (login required)
 |
View Item |
