An introduction to automata theory
An introduction to automata theory
APN 90 Proceedings on Advances in Petri nets 1990
Numerical Analysis of Superposed GSPNs
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Mean value analysis of stochastic Petri nets
Performance Evaluation
Modelling with Generalized Stochastic Petri Nets
ACM SIGMETRICS Performance Evaluation Review - Special issue on Stochastic Petri Nets
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
IEEE Transactions on Computers
Generalized Stochastic Petri Nets: A Definition at the Net Level and its Implications
IEEE Transactions on Software Engineering
Approximate Throughput Computation of Stochastic Marked Graphs
IEEE Transactions on Software Engineering
Aggregation Methods in Exact Performance Analyssi of Stochastic Petri Nets
PNPM '89 The Proceedings of the Third 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
Improving the linearly based characterization of P/T nets
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Evaluation of high level Petri nets by means of aggregation and decomposition
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Numerical analysis of stochastic marked graph nets
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Structured Solution of Stochastic DSSP Systems
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
Transient Analysis of Superposed GSPNs
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS
ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS
Complexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models
Hierarchical Reachability Graph Generation for Petri Nets
Formal Methods in System Design
IEEE Transactions on Computers
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
Integrating Synchronization with Priority into a Kronecker Representation
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
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
Memory efficient analysis for a class of large structured Markov chains: work in progress
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Hi-index | 0.01 |
Asynchronously Communicating Stochastic Modules (SAM) are Petri nets that can be seen as a set of modules that communicate through buffers, so they are not (yet another) Petri net subclass, but they complement a net with a structured view. This paper considers the problem of exploiting the compositionality of the view to generate the state space and to find the steady-state probabilities of a stochastic extension of SAM in a net-driven, efficient way. Essentially, we give an expression of an auxiliary matrix, ${\schmi{\bf G}}$, which is a supermatrix of the infinitesimal generator of a SAM. ${\schmi{\bf G}}$ is a tensor algebra expression of matrices of the size of the components for which it is possible to numerically solve the characteristic steady-state solution equation ${\schmi {\bf \pi}} \; \cdot \; {\schmi{\bf G}}={\schmi{\bf 0}},$ without the need to explicitly compute ${\schmi{\bf G}}$. Therefore, we obtain a method that computes the steady-state solution of a SAM without ever explicitly computing and storing its infinitesimal generator, and therefore without computing and storing the reachability graph of the system. Some examples of application of the technique are presented and compared to previous approaches