For the most recent entries see the Petri Nets Newsletter.

Iterative Decomposition and Aggregation of Stochastic Marked Graph Petri Nets.

Li, Y.; Woodside, C. Murray

In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 674; Advances in Petri Nets 1993, pages 325-349. Springer-Verlag, 1993.

Abstract: This paper addresses the problem of state explosion and computational complexity in solving marked graph Stochastic Petri Nets (SPNs). We first develop a simple and powerful Petri Nets (PNs) reduction technique that reduces the size of a marked graph PN. Then we propose an iterative delay equivalent reduction technique to solve the reduced SPN. This method iteratively tunes two or more partly aggregated auxiliary SPNs until they are approximately delay equivalent to the original SPN. It avoids the direct solution of the original SPN. In our experience the iteration usually converges and the accuracy is usually better than 5%, though there are exceptional cases. The technique is a step towards approximating more general SPNs.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography