Reasoning about proportional lumpability
From MaRDI portal
Publication:832089
Recommendations
Cites work
- scientific article; zbMATH DE number 3514781 (Why is no real title available?)
- scientific article; zbMATH DE number 714457 (Why is no real title available?)
- 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)