In: Archiwum Automatyki i Telemechaniki, Vol. 33, No. 1, pages 131-145. 1988. In Polish.
Abstract: Timed Petri nets with live and bounded initial marking are a useful tool in the performance evaluation of concurrent systems. A characteristic feature of such nets is the cyclic operation. Hence the cycle time is chosen as the performance evaluation measure. To maximize the effectiveness of a concurrent system, the system cycle time is to be minimized. The computational complexity of the minimal cycle time problem is analyzed for different classes of Petri nets.