Extensions on performance evaluation techniques for concurrent systems

The authors present a procedure for computing the cycle time of concurrent systems modeled by a restricted class of Petri nets, i.e. decision-free and safe persistent nets. The procedure is based on formulating the cycle time computation as a minimal cost-to-time ratio cycle problem. The result is an efficient algorithm with a computational complexity of O(n³log₂ n). By using an example with a stochastic counterpart, it is shown that the results are consistent with those obtained by more complex Markov analysis