Improving the linearly based characterization of P/T nets
APN 90 Proceedings on Advances in Petri nets 1990
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
IEEE Transactions on Computers
Approximate Throughput Computation of Stochastic Marked Graphs
IEEE Transactions on Software Engineering
Generalized Stochastic Petri Nets Revisitied: Random Switches and Priorities
PNPM '87 The Proceedings of the Second International Workshop on Petri Nets and Performance Models
Asynchronous Composition of High Level Petri Nets: A Quantitative Approach
Proceedings of the 17th 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
Numerical analysis of stochastic marked graph nets
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Numerical analysis of superposed GSPNs
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Performance Analysis Using Stochastic Petri Nets
IEEE Transactions on Computers
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
Structured Solution of Asynchronously Communicating Stochastic Modules
IEEE Transactions on Software Engineering
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
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
Structured Characterization of the Markov Chain of Phase-Type SPN
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
| Hi-index | 0.00 |
Deterministically Synchronized Sequential Processes (DSSP) are essentially states machines that communicate, may be in complex forms but under some restricted patterns, through buffer places; their definition is compositional by nature. This paper considers the problem of exploiting this compositionality to generate the state space and to find the steady state probabilities of a stochastic extension of DSSP in a "net-driven", efficient way. Essentially, we give an expression of an auxiliary matrix, G, which is a supermatrix of the infinitesimal generator of a DSSP. G is a tensor algebra expression of matrices of the size of the components for which it is possible to numerically solve the characteristic equation Pi.G = 0, without the need to explicitly compute G. Therefore, we obtain a method that computes the steady state solution of a DSSP without ever explicitly computing and storing its infinitesimal generator, and therefore without computing and storing the reachability graph of the system.