# Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications

## TL;DR

This paper introduces a method to control reversibility in Reversing Petri Nets by associating transitions with conditions, demonstrated through a distributed antenna selection algorithm in wireless communications.

## Contribution

It presents a novel approach to control transition reversibility in RPNs using conditions, enhancing modeling capabilities for distributed systems.

## Key findings

- Effective control of reversibility in RPNs demonstrated
- Application to distributed antenna selection algorithm
- Framework supports causal and spontaneous reversals

## Abstract

Petri nets are a formalism for modelling and reasoning about the behaviour of distributed systems. Recently, a reversible approach to Petri nets, Reversing Petri Nets (RPN), has been proposed, allowing transitions to be reversed spontaneously in or out of causal order. In this work we propose an approach for controlling the reversal of actions of an RPN, by associating transitions with conditions whose satisfaction/violation allows the execution of transitions in the forward/reversed direction, respectively. We illustrate the framework with a model of a novel, distributed algorithm for antenna selection in distributed antenna arrays.