Peter Buchholz
Abstract
This paper examines the (semi) automatic generation of a hierarchical structure for generalized stochastic Petri nets (GSPNs). The idea is to partition a GSPN automatically into a set of components with asynchronous communication. Net level results obtained by invariant computation for these subnets are used to define a macro description of the internal state. This yields a hierarchical structure which is exploited in several efficient analysis algorithms. These algorithms include reachability set/graph generation, structured numerical analysis techniques and approximation techniques based on decomposition and aggregation. A GSPN model of an existing production cell and its digital control is analyzed to demonstrate usefulness of the approach.
Index Terms
- On generating a hierarchy for GSPN analysis
Recommendations
A Characterization of the Stochastic Process Underlying a Stochastic Petri Net
Stochastic Petri nets (SPN's) with generally distributed firing times can model a large class of systems, but simulation is the only feasible approach for their solution. We explore a hierarchy of SPN classes where modeling power is reduced in exchange ...
Performance Analysis of Computing Servers A Case Study Exploiting a New GSPN Semantics
MMB & DFT 2014: Proceedings of the 17th International GI/ITG Conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance - Volume 8376Generalised Stochastic Petri Nets (GSPNs) are a widely used modeling formalism in the field of performance and dependability analysis. Their semantics and analysis is restricted to "well-defined", i.e., confusion-free, nets. Recently, a new GSPN ...
Distributed Response Time Analysis of GSPN Models with MapReduce
Generalized stochastic Petri nets (GSPNs) are widely used in the performance analysis of computer and communications systems. Response time densities and quantiles are often key outputs of such analysis. These can be extracted from a GSPN's underlying ...
Comments