Reasoning about proportional lumpability
From MaRDI portal
Publication:832089
DOI10.1007/978-3-030-85172-9_20zbMATH Open1491.68030OpenAlexW3196094758MaRDI QIDQ832089FDOQ832089
Authors: Carla Piazza, Sabina Rossi 
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85172-9_20
Recommendations
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Compositional Approach to Performance Modelling
- A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS
- A necessary condition for weak lumpability in finite Markov processes
- Exact and ordinary lumpability in finite Markov chains
- Interactive Markov chains. And the quest for quantified quality
- Jointly optimal allocation of a repairman and optimal control of service rate for machine repairman problem
- Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains
- Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
- On the convergence of the power series algorithm
- On the relations between Markov chain lumpability and reversibility
- Optimal Repair Allocation in a Series System
- Optimal state-space lumping in Markov chains
- Proportional lumpability
- Queueing networks
- Simple \(O(m \log n)\) time Markov chain lumping
- Three Partition Refinement Algorithms
Cited In (5)
This page was built for publication: Reasoning about proportional lumpability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832089)
