Issue No.05 - May (1987 vol.13)
J. Magott , Institute of Engineering Cybernetics, Technical University of Wroclaw
Timed Petri nets are useful in performance evaluation of concurrent systems. The maximum computation rate is achieved for minimal cycle time of timed Petri net. It is known that minimal cycle time problem for P-invariant Petri nets is NP-complete. In this paper we prove that the minimal cycle time problem, for non-P-invariant Petri nets and for a small subclass of P-invariant Petri nets called free-choice nets having live and safe marking, is NP-complete.
timed Petri net, Computational complexity, free-choice net, minimal cycle time, non-P-invariant Petri net, performance evaluation
J. Magott, "New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets", IEEE Transactions on Software Engineering, vol.13, no. 5, pp. 578-581, May 1987, doi:10.1109/TSE.1987.233462