Applying timed-arc Petri nets to improve the performance of the MPEG-2 encoding algorithm

We use a timed extension of Petri nets, the so called timed-arc Petri Nets, for the specification and analysis of the MPEG-2 video encoder. We have computed bounds for the necessary time to encode each type of frame, also we present an improvement on the encoding process which takes advantage of the potential parallelism degree of the MPEG-2 video encoding algorithm, so reaching a 90% of reduction on the time requirements, with respect to the original MPEG-2 encoder.