For the most recent entries see the Petri Nets Newsletter.

State Space Construction and Steady-State Solution of GSPNs on a Shared-Memory Multiprocessor.

Allmaier, S.C.; Kowarschik, M.; Horton, G.

In: Proceedings of the Seventh International Workshop on Petri Nets and Performance Models, June 3-6, 1997, Saint Malo, France, pages 112-121. Los Alamitos, California: IEEE Computer Society, June 1997.

Abstract: A common approach for the quantitative analysis of a generalized stochastic Petri net (GSPN) is to generate its entire state space and then solve the corresponding continuous-time Markov chain (CTMC) numerically. This analysis often suffers from two major problems: the state space explosion and the stiffness of the CTMC. In this paper we present parallel algorithms for shared-memory machines that attempt to alleviate both of these difficulties: the large main memory capacity of a multiprocessor can be utilized and long computation times are reduced by efficient parallelization. The algorithms comprise both CTMC construction and numerical steady-state solution. We give experimental results obtained with a Convex SPP1600 shared-memory multiprocessor that show the behavior of the algorithms and the parallel speedups obtained.

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

Back to the Petri Nets Bibliography