For the most recent entries see the Petri Nets Newsletter.

Iterative Decomposition and Aggregation of Stochastic Marked Graph Petri Nets.

Li, Yao; Woodside, C. Murray

In: Proceedings of the 12th International Conference on Application and Theory of Petri Nets, 1991, Gjern, Denmark, pages 257-275. June 1991.

Abstract: This paper addresses the problem of state explosion and computational complexity in solving marked graph Stochastic Petri Nets (SPNs). The authors develop a Petri Nets (PNs) reduction technique that reduces the size of a marked graph PN. The authors propose an iterative delay equivalent reduction technique so solve the reduced SPN. This method iteratively tunes partly aggregated auxiliary SPNs until they are approximately delay equivalent to the original SPN. In the authors' experience the iteration usually converges and the accuracy is better than 5%. The technique is a step towards approximating more general SPNs.

Keywords: iterative decomposition (and) aggregation (of) stochastic marked graph net(s); state explosion; computational comlexity; delay equivalent net reduction; generalized stochastic net; Markov chain.


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

Back to the Petri Nets Bibliography