In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 424; Advances in Petri Nets 1989, pages 30-50. Berlin, Germany: Springer-Verlag, 1990.
Abstract: The applicability of DSPN models has been limited by the computational complexity of the algorithm for the evaluation of the steady state probability distribution over reachable markings, so that it was often necessary to resort to simulation rather than analysis. Two techniques for improvement of the efficiency of the analysis of DSPN are outlined, using a previously published model of high speed local area network as an example of the application of the proposed techniques, and as a benchmark for the assessment of their efficiency.
Keywords: timed transition net; local area network.