Reversible computation in nets with bonds
From MaRDI portal
This paper proposes a reversible model inspired by Petri nets that allows the modelling of reversibility as realized by backtracking, causal-order reversing, and out-of-causal-order reversing. The model employs named tokens that can be connected together to form bonds. Furthermore, reversing Petri nets satisfy the conservation property in the sense that the number of tokens in the net remains constant during execution. In the presence of individual tokens, this implies that the set of tokens is preserved.
Recommendations
Cites work
- A calculus for local reversibility
- A compositional semantics for the reversible -calculus
- A note on transition systems
- A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
- CONCUR 2004 - Concurrency Theory
- CONCUR 2005 – Concurrency Theory
- CONCUR 2005 – Concurrency Theory
- Concurrency and reversibility
- Concurrent flexible reversibility
- Controlling Reversibility in Higher-Order Pi
- Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications
- Foundations of Software Science and Computation Structures
- General reversibility
- scientific article; zbMATH DE number 2088673 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- Irreversibility and Heat Generation in the Computing Process
- Modelling of Bonding with Processes and Events
- Petri nets with individual tokens
- Reversibility and asymmetric conflict in event structures
- Reversible computation in Petri nets
- Reversible computation vs. reversibility in Petri nets
- Reversible occurrence nets and causal reversible prime event structures
- Reversing Higher-Order Pi
- Rule-Based Modelling of Cellular Signalling
- Sequential and concurrent behaviour in Petri net theory
- The chemical abstract machine
- Understanding Petri Nets
Cited in
(17)- Reversible computation in term rewriting
- Reversible computation in Petri nets
- A Petri net view of covalent bonds
- Lifted structural invariant analysis of Petri net product lines
- Formal translation from reversing Petri nets to coloured Petri nets
- A collective interpretation semantics for reversing Petri nets
- Reversible computation vs. reversibility in Petri nets
- Reversing transitions in bounded Petri nets
- Investigating reversibility of steps in Petri nets
- Reversibility vs Local Creation/Destruction
- Acyclic and cyclic reversing computations in Petri nets
- Towards a taxonomy for reversible computation approaches
- Token multiplicity in reversing Petri nets under the individual token interpretation
- Relating reversible Petri nets and reversible event structures, categorically
- Model checking reversible systems: forwardly
- Relating reversible Petri nets and reversible event structures, categorically
- On reversibility in Petri nets
This page was built for publication: Reversible computation in nets with bonds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2667186)