Polynomial Throughput Bounds for Equal Conflict Petri Nets with Multi-guarded Transitions

Early evaluation is a strategy that aims at enhancing the system performance by executing operations as soon as enough information is available. A common unit that allows early evaluation is the multiplexer: its output can be produced as soon as data is available in the selected channel, without waiting for data in the other channels. Petri nets can model early evaluation of operations by associating several guards with each transition. A multi-guarded transition can fire as soon as the guard selected for the next firing is satisfied. This paper proposes a linear programming problem to compute throughput bounds for equal conflict Petri nets with multi-guarded transitions.