Performance evaluation of petri nets execution algorithms

In this paper we present a performance evaluation of interpreted and centralized implementation techniques of Petri nets. These implementation techniques allow the translation of a system model expressed by a Petri net to an actual system with the same behaviour as the model. It has been used in different application fields such as programmable logic controllers. Four techniques have been analysed: Brute Force, Enabled Transitions, Static Representing Places and Dynamic Representing Places. The analysis has been carried out over a Petri net library composed by well know models which can be scaled using a parameter. The analysis of results shows that the performance of the algorithms depends on the Petri net behaviour (concurrency v.s. effective conflicts). However, it is also showed that Brute Force technique can be discarded and that the Static Representing Places performs better that the dynamic version when the selection of representing places is done based on behavioural information.