Dice Question Streamline Icon: https://streamlinehq.com

Relaxing the past-to-future requirement in space-time reversibility

Determine whether the formal definition of space-time reversibility for local operators in space-time deterministic graph rewriting can be weakened so that an operator applied at position x does not necessarily map a past vertex at position x to a future vertex at the same position, while still admitting a backwards local inverse and preserving the locality axioms.

Information Square Streamline Icon: https://streamlinehq.com

Background

The paper formalizes space-time reversibility for local operators within the framework of space-time deterministic graph rewriting. Under this definition, a reversible local operator necessarily transforms the positions of past vertices into those of future vertices, a property highlighted earlier in the text. The authors explicitly pose whether this requirement can be relaxed without breaking the notion of reversibility and its local inverse.

Relaxing this constraint would broaden the class of reversible rules and could impact how reversibility interacts with scheduling non-determinism and space-time determinism in asynchronous settings.

References

In its current state our work leaves a number of technical questions open. A more basic question is whether our definition of reversibility can be relaxed so that A_x does not systematically send x past to x future.

Space-time reversible graph rewriting (2510.03296 - Arrighi et al., 29 Sep 2025) in Section 7 (Conclusion), Open questions