General Reversibility

Authors:
Vincent Danos;Jean Krivine;Paweł Sobociński
Affiliations:
CNRS & Universitéé Paris 7;INRIA Rocquencourt & Universitéé Paris 6;Computer Laboratory, University of Cambridge
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 5
Cited 3

Petri nets are moniods

Information and Computation
A Calculus of Communicating Systems

A Calculus of Communicating Systems
A Factorisation Theorem in Rewriting Theory

CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Transactions in RCCS

CONCUR 2005 - Concurrency Theory
Reversing algebraic process calculi

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures

Computational self-assembly

Theoretical Computer Science
Reversible enhanced event structures: Towards reversible E-LOTOS

Computer Standards & Interfaces
Reversing higher-order pi

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory

Quantified Score

Hi-index	0.00

Visualization

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.