Proportional lumpability and proportional bisimilarity
From MaRDI portal
Publication:2139185
DOI10.1007/s00236-021-00404-yMaRDI QIDQ2139185
Sabina Rossi, Carla Piazza, Andrea Marin
Publication date: 17 May 2022
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-021-00404-y
68Qxx: Theory of computing
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
- 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
- Adaptive aggregation of Markov chains: quantitative analysis of chemical reaction networks
- Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
- Proportional lumpability
- Comparative branching-time semantics for Markov chains
- On the relations between Markov chain lumpability and reversibility
- Semi-Product-Form Solution for PEPA Models with Functional Rates
- Queueing Networks
- Product form equilibrium distributions and a convolution algorithm for stochastic Petri nets
- Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains
- Queuing Network Models with State-Dependent Routing
- Exact and ordinary lumpability in finite Markov chains
- The Effect of Lumping and Expanding on Kinetic Differential Equations
- A Compositional Approach to Performance Modelling
- Symbolic computation of differential equivalences
