Hierarchical Reachability Graph Generation for Petri Nets
Formal Methods in System Design
Advances in Model Representations
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Kronecker Algebra and (Stochastic) Petri Nets: Is It Worth the Effort?
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
A Toolbox for Functional and Quantitative Analysis of DEDS
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Distributed Numerical Markov Chain Analysis
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Adaptive decomposition and approximation for the analysis of stochastic petri nets
Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
Structured analysis techniques for large Markov chains
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
| Hi-index | 0.00 |
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.