Throughput calculation for basic stochastic rendezvous networks
Performance Evaluation
Approximate performance models of polling systems using Stochastic Petri nets
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
A decomposition approach for stochastic reward net models
Performance Evaluation
Efficient descriptor-vector multiplications in stochastic automata networks
Journal of the ACM (JACM)
Algebric Decision Diagrams and Their Applications
Formal Methods in System Design
Fixed Point Iteration in Availability Modeling
Proceedings of the 5th International GI/ITG/GMA Conference on Fault-Tolerant Computing Systems, Tests, Diagnosis, Fault Treatment
Petri Net Analysis Using Boolean Manipulation
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Storage Alternatives for Large Structured State Spaces
Proceedings of the 9th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
INFORMS Journal on Computing
Fixed point iteration using stochastic reward 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
A Data Structure for the Efficient Kronecker Solution of GSPNs
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
SMART: Simulation and Markovian Analyzer for Reliability and Timing
IPDS '96 Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96)
Analytic Queueing Models for Programs with Internal Concurrency
IEEE Transactions on Computers
Efficient symbolic state-space construction for asynchronous systems
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Advances in Model Representations
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
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 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
Structured analysis techniques for large Markov chains
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Approximating stationary measures of structured continuous-time Markov models using matrix diagrams
ACM SIGMETRICS Performance Evaluation Review
Bisimulation relations for weighted automata
Theoretical Computer Science
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
Approximation of discrete-time polling systems via structured Markov chains
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
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
Data representation and efficient solution: a decision diagram approach
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Product form approximations for communicating Markov processes
Performance Evaluation
Lumping partially symmetrical stochastic models
Performance Evaluation
A framework to decompose GSPN models
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
| Hi-index | 0.00 |
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algebra, for a Markov model with K submodels. Our algorithm builds and solves K Markov chains, each corresponding to a different aggregation of the exact process, guided by the structure of the decision diagram, and iterates on their solution until their entries are stable. We prove that exact results are obtained if the overall model has a product-form solution. Advantages of our method include good accuracy, low memory requirements, fast execution times, and a high degree of automation, since the only additional information required to apply it is a partition of the model into the K submodels. As far as we know, this is the first time an approximation algorithm has been proposed where knowledge of the exact state space is explicitly used.