Universality of reversible graph rewriting for reversible systems

Determine whether space-time reversible graph rewriting can simulate any reversible cellular automaton and any reversible causal graph dynamics, by constructing appropriate reversible local operators whose space-time evolutions reproduce the dynamics of these reversible models.

Background

Previous work established that space-time deterministic graph rewriting (in the non-reversible setting) can simulate any cellular automaton. Here, the authors ask whether the reversible version attains a similar universality with respect to reversible cellular automata and to reversible causal graph dynamics.

Establishing such universality would position space-time reversible graph rewriting as a foundational model capable of capturing a broad class of reversible discrete dynamics, aligning with results known for reversible cellular automata and their block/involution representations.