Performance evaluation of distributed systems

Some evaluation techniques for distributed systems are prevented. In order to model clearly the synchronization, involved in these systems, a Petri net model is used. We focus on the performance evaluation of a strongly connected event graph with random firing times. We have an upper bound and a lower bound for the average cycle time of event graphs knowing the initial marking. We propose an algorithm to evaluate the bounds used to calculate an average cycle time. An application of the results to the evaluation of a kanban system is proposed.