| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 423986 | Electronic Notes in Theoretical Computer Science | 2007 | 12 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
