Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution

In a previous paper we have defined Superposed Stochastic Automata (SSA) [13], a class of Stochastic Petri Nets (SPN) whose solution can be efficiently computed since it never requires the construction of the complete Markov chain of the underlying Markovian process. The efficient solution of SSA is based on a method proposed by Plateau in [23] for the analysis of stochastic processes generated by the composition of stochastic automata. Efficient analysis is there achieved (both in terms of space and time) with a technique based on Kronecker (tensor) algebra for matrices.

[1]  Ajmone MarsanMarco,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984 .

[2]  Giorgio De Michelis,et al.  Superposed Automata Nets , 1980, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.

[3]  Giovanni Chiola,et al.  Stochastic Well-Formed Coloured Nets and Multiprocessor Modelling Applications , 1991 .

[4]  Jean-Michel Fourneau,et al.  PEPS: A Package for Solving Complex Markov Models of Parallel Systems , 1989 .

[5]  Susanna Donatelli,et al.  Superposed Stochastic Automata: A Class of Stochastic Petri Nets with Parallel Solution and Distributed State Space , 1993, Perform. Evaluation.

[6]  Brigitte Plateau,et al.  Stochastic Automata Network For Modeling Parallel Systems , 1991, IEEE Trans. Software Eng..

[7]  C. Beounes.  Stochastic Petri Net Modeling for Dependability Evaluation of Complex Computer Systems , 1985, PNPM.

[8]  Michael K. Molloy.  Performance Analysis Using Stochastic Petri Nets , 1982, IEEE Transactions on Computers.

[9]  Brigitte Plateau.  On the stochastic structure of parallelism and synchronization models for distributed algorithms , 1985, SIGMETRICS 1985.

[10]  Giuliana Franceschinis,et al.  Understanding Parallel Program Behavior through Petri Net Models , 1992, J. Parallel Distributed Comput..

[11]  Stefano Russo,et al.  Software Architecture of the EPOCA Integrated Environment , 1994, Computer Performance Evaluation.

[12]  Stéphane Natkin,et al.  Matrix product form solution for closed synchronized queuing networks , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[13]  Peter G. Taylor,et al.  Aggregation methods in exact performance analysis of stochastic Petri nets , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[14]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

[15]  Marc Davio,et al.  Kronecker products and shuffle algebra , 1981, IEEE Transactions on Computers.

[16]  Stéphane Natkin,et al.  Timed and Stochastic Petri Nets: From the Validation to the Performance of Synchronization Schemes , 1985, Petri Nets and Performance Models.

[17]  Giovanni Chiola,et al.  An introduction to generalized stochastic Petri nets , 1991 .

[18]  Kishor S. Trivedi,et al.  The Design of a Unified Package for the Solution of Stochastic Petri Net Models , 1985, PNPM.

[19]  Giovanni Chiola,et al.  GSPNs versus SPNs: what is the actual role of immediate transitions? , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

[20]  Kishor S. Trivedi,et al.  A decomposition approach for stochastic Petri net models , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

[21]  Thomas G. Robertazzi,et al.  Markovian Petri Net Protocols with Product Form Solution , 1991, Perform. Evaluation.