Reasoning about proportional lumpability

DOI10.1007/978-3-030-85172-9_20zbMath1491.68030OpenAlexW3196094758MaRDI QIDQ832089

Sabina Rossi, Carla Piazza

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-85172-9_20

zbMATH Keywords

algorithmsMarkov chainslumpability

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• A necessary condition for weak lumpability in finite Markov processes
• Interactive Markov chains. And the quest for quantified quality
• Optimal state-space lumping in Markov chains
• Jointly optimal allocation of a repairman and optimal control of service rate for machine repairman problem
• Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
• Proportional lumpability
• On the relations between Markov chain lumpability and reversibility
• Queueing Networks
• Simple O(m logn) Time Markov Chain Lumping
• Optimal Repair Allocation in a Series System
• Three Partition Refinement Algorithms
• Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains
• Exact and ordinary lumpability in finite Markov chains
• On the convergence of the power series algorithm
• A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS
• A Compositional Approach to Performance Modelling

This page was built for publication: Reasoning about proportional lumpability