Proportional lumpability and proportional bisimilarity
From MaRDI portal
(Redirected from Publication:2139185)
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?)
- scientific article; zbMATH DE number 7333244 (Why is no real title available?)
- A Compositional Approach to Performance Modelling
- A necessary condition for weak lumpability in finite Markov processes
- Adaptive aggregation of Markov chains: quantitative analysis of chemical reaction networks
- Comparative branching-time semantics for Markov chains
- Exact and ordinary lumpability in finite Markov chains
- Interactive Markov chains. And the quest for quantified quality
- 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 relations between Markov chain lumpability and reversibility
- On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
- Optimal state-space lumping in Markov chains
- Product form equilibrium distributions and a convolution algorithm for stochastic Petri nets
- Proportional lumpability
- Queueing networks
- Queuing Network Models with State-Dependent Routing
- Revisiting interactive Markov chains
- Semi-product-form solution for PEPA models with functional rates
- Symbolic computation of differential equivalences
- The Effect of Lumping and Expanding on Kinetic Differential Equations
Cited in
(3)
This page was built for publication: Proportional lumpability and proportional bisimilarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139185)