Performance analysis of timed Petri nets
Bruno Gaujal, Mohsen A. Jafari, M.B. Gursoy · 2002
We study a system composed of two processes sharing a resource. The system can be modeled as a general Petri net and thus its performance analysis cannot be achieved using a minimax algebra. However, if the allocation sequence is known, we can transform the system into a decision free net. We show that in many cases this allocation sequence is the most regular integer sequence satisfying the frequency of allocation. >