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
Distributed and structured analysis approaches to study large and complex systems
Lectures on formal methods and performance analysis
Response time densities in generalised stochastic petri net models
WOSP '02 Proceedings of the 3rd international workshop on Software and performance
IEEE Transactions on Computers
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
Advances in Model Representations
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Out-of-Core Solution of Large Linear Systems of Equations Arising from Stochastic Modelling
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Integrating Synchronization with Priority into a Kronecker Representation
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
The Möbius State-Level Abstract Functional Interface
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
The Möbius state-level abstract functional interface
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
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
Implicit GSPN reachability set generation using decision diagrams
Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
Model-Based Evaluation: From Dependability to Security
IEEE Transactions on Dependable and Secure Computing
Journal of Parallel and Distributed Computing
On the benefits of using functional transitions and Kronecker algebra
Performance Evaluation
Implicit data structures for logic and stochastic systems analysis
ACM SIGMETRICS Performance Evaluation Review
Logic and stochastic modeling with SMART
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
Future Generation Computer Systems - Systems performance analysis and evaluation
Saturation for a General Class of Models
IEEE Transactions on Software Engineering
Modelling of Biochemical Reactions by Stochastic Automata Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximating stationary measures of structured continuous-time Markov models using matrix diagrams
ACM SIGMETRICS Performance Evaluation Review
Split: a flexible and efficient algorithm to vector-descriptor product
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Approximate transient analysis of large stochastic models with WinPEPSY-QNS
Computer Networks: The International Journal of Computer and Telecommunications Networking
Advanced features in SMART: the stochastic model checking analyzer for reliability and timing
ACM SIGMETRICS Performance Evaluation Review
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
Formal Verification of the NASA Runway Safety Monitor
Electronic Notes in Theoretical Computer Science (ENTCS)
Continuous Time Bayesian Network Reasoning and Learning Engine
The Journal of Machine Learning Research
A symbolic algorithm for optimal Markov chain lumping
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Tackling large state spaces in performance modelling
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Data representation and efficient solution: a decision diagram approach
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Symbolic partition refinement with automatic balancing of time and space
Performance Evaluation
Stochastic Petri net models of Ca2+ signaling complexes and their analysis
Natural Computing: an international journal
Expressiveness and efficient analysis of stochastic well-formed nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
Ten years of saturation: a petri net perspective
Transactions on Petri Nets and Other Models of Concurrency V
Performance evaluation of sensor networks by statistical modeling and euclidean model checking
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
Kronecker-based approaches have been proposed for the solution of structured GSPNs with extremely large state spaces. Representing the transition rate matrix using Kronecker sums and products of smaller matrices virtually eliminates its storage requirements, but introduces various sources of overhead. We show how, by using a new data structure which we call matrix diagrams, we are able to greatly reduce or eliminate many of these overheads, resulting in a very efficient overall solution process.