A framework to decompose GSPN models

Authors:
Leonardo Brenner;Paulo Fernandes;Afonso Sales;Thais Webber
Affiliations:
Pontifícia Universidade Católica do Rio Grande do Sul, Porto Alegre, Brazil;Pontifícia Universidade Católica do Rio Grande do Sul, Porto Alegre, Brazil;Pontifícia Universidade Católica do Rio Grande do Sul, Porto Alegre, Brazil;Pontifícia Universidade Católica do Rio Grande do Sul, Porto Alegre, Brazil
Venue:
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Year:
2005

Citing 15
Cited 0

A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems

ACM Transactions on Computer Systems (TOCS)
Petri nets: an introduction

Petri nets: an introduction
Stochastic Automata Network of Modeling Parallel Systems

IEEE Transactions on Software Engineering
Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space

Performance Evaluation
Efficient descriptor-vector multiplications in stochastic automata networks

Journal of the ACM (JACM)
On the stochastic structure of parallelism and synchronization models for distributed algorithms
Using the exact state space of a Markov model to compute approximate stationary measures

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Hierarchical Reachability Graph Generation for Petri Nets

Formal Methods in System Design
An Efficient Kronecker Representation for PEPA Models

PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Efficient Reachability Set Generation and Storage Using Decision Diagrams

Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution

Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models

INFORMS Journal on Computing
Efficient Solution of GSPNs Using Canonical Matrix Diagrams

PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
Data structures for the analysis of large structured markov models

Data structures for the analysis of large structured markov models
Kronecker products and shuffle algebra

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a framework to decompose a single GSPN model into a set of small interacting models. This decomposition technique can be applied to any GSPN model with a finite set of tangible markings and a generalized tensor algebra (Kronecker) representation can be produced automatically. The numerical impact of all the possible decompositions obtained by our technique is discussed. To do so we draw the comparison of the results for some practical examples. Finally, we present all the computational gains achieved by our technique, as well as the future extensions of this concept for other structured formalisms.