Cycle time computation in deterministically timed weighted marked graphs

This paper considers the minimum cycle time (MCT) computation in deterministically timed weighted marked graphs (WMGs) under infinite server semantics. A transformation from a live and bounded WMG system into a live and bounded MG system is proposed in which the untimed behavior (represented by the Petri net language) and the minimum cycle time are preserved. By applying the well known LPP to the transformed MG system, the MCT can be computed exactly. The computational complexity of our approach is polynomial with respect to |X|, the size of the elementary T-semiflow of the original WMG.