ABSTRACT
This chapter reviews the reduction rules known for Generalized Stochastic Petri Nets (GSPN) and Stochastic Well-formed Nets (SWN) — a type of colored SPNs. It presents the most useful GSPN reduction techniques, and an example of application of the GSPN reduction rules to the analysis of a symmetrical random polling GSPN model. The chapter provides the SWN formalism, and the SWN reduction rules. It shows how a SWN model of a random polling system can be reduced through the application of the SWN reduction rules. The chapter deals with a comparison of the GSPN and SWN reduction approaches, and with an indication about the possibility of automating the SWN reduction process as a useful intermediate step in the solution of SWN models. GSPN and SWN models of a symmetrical random polling system are used as running examples: reduction rules are applied to both, showing the effectiveness of the reduction approach.
