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.
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|
|Divisions :||Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
|Accepted Date and Publication Date:||
|Date Deposited:||19 Feb 2007|
|Last Modified:||31 Mar 2016 14:07|
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Available Versions of this Item
General reversibility. (deposited 19 Feb 2007)
- General reversibility. (deposited 19 Feb 2007) [Currently Displayed]
Actions (login required)