On the solution of GSPN reward models
Performance Evaluation
Stochastic Automata Network of Modeling Parallel Systems
IEEE Transactions on Software Engineering
A compositional approach to performance modelling
A compositional approach to performance modelling
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Model checking meets performance evaluation
ACM SIGMETRICS Performance Evaluation Review
Lumping Markov Chains with Silent Steps
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Structured analysis techniques for large Markov chains
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science - Components and objects
Compositionality for Markov reward chains with fast transitions
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
Paper: Optimal control of markov chains admitting strong and weak interactions
Automatica (Journal of IFAC)
Location Prediction Based on a Sector Snapshot for Location-Based Services
Journal of Network and Systems Management
Hi-index | 0.01 |
A parallel composition is defined for Markov reward chains with stochastic discontinuity, and with fast and silent transitions. In this setting, compositionality with respect to the relevant aggregation preorders is established. For Markov reward chains with fast transitions the preorders are @t-lumping and @t-reduction. Discontinuous Markov reward chains are 'limits' of Markov reward chains with fast transitions, and have related notions of lumping and reduction. Markov reward chains with silent transitions are equivalence classes of Markov reward chains with fast transitions and come equipped with the lifted preorders @t"~-lumping and @t"~-reduction. In total, six compositionality results are presented. Additionally, the parallel operators involved are related by a continuity result.