Reversible causal graph dynamics: invertibility, block representation, vertex-preservation - Archive ouverte HAL Access content directly
Journal Articles Natural Computing Year : 2019

Reversible causal graph dynamics: invertibility, block representation, vertex-preservation

(1) , (2) , (3, 4, 5)
1
2
3
4
5

Abstract

Causal Graph Dynamics extend Cellular Automata to arbitrary time-varying graphs of bounded degree. The whole graph evolves in discrete time steps, and this global evolution is required to have a number of symmetries: shift-invariance (it acts everywhere the same) and causality (information has a bounded speed of propagation). We add a further physics-like symmetry, namely reversibility. In particular, we extend two fundamental results on reversible cellular automata, by proving that the inverse of a causal graph dynamics is a causal graph dynamics, and that these reversible causal graph dynamics can be represented as finite-depth circuits of local reversible gates. We also show that reversible causal graph dynamics preserve the size of all but a finite number of graphs.
Not file

Dates and versions

hal-02400095 , version 1 (09-12-2019)

Identifiers

Cite

Pablo Arrighi, Simon Martiel, Simon Perdrix. Reversible causal graph dynamics: invertibility, block representation, vertex-preservation. Natural Computing, 2019, ⟨10.1007/s11047-019-09768-0⟩. ⟨hal-02400095⟩
111 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More