General Reversibility

DOI10.1016/j.entcs.2006.07.036zbMath1277.68175OpenAlexW2913096018MaRDI QIDQ2866345

Vincent Danos, Paweł Sobociński, Jean Krivine

Publication date: 13 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.07.036

zbMATH Keywords

Petri netreversible computationCCSreversible calculus of communicating systems (RCCS)

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Factorization systems, substructures, quotient structures, congruences, amalgams (18A32)

Related Items (12)

Reversibility in the higher-order \(\pi\)-calculus ⋮ Reversible Computation vs. Reversibility in Petri Nets ⋮ Reversible computation in nets with bonds ⋮ Reversibility and asymmetric conflict in event structures ⋮ Towards a categorical representation of reversible event structures ⋮ Reversing Steps in Petri Nets ⋮ An axiomatic approach to reversible computation ⋮ Subobject transformation systems ⋮ Computational self-assembly ⋮ On the hierarchy of d-structures ⋮ Self-assembling Trees ⋮ Investigating Reversibility of Steps in Petri Nets

Cites Work

• Unnamed Item
• Unnamed Item
• Petri nets are monoids
• A calculus of communicating systems
• The geometry of tensor calculus. I
• Higher categories, strings, cubes and simplex equations
• Categories of continuous functors. I
• Self-assembling Trees
• CONCUR 2004 - Concurrency Theory
• CONCUR 2005 – Concurrency Theory
• Foundations of Software Science and Computation Structures

This page was built for publication: General Reversibility