Optimal state-space lumping in Markov chains
From MaRDI portal
Recommendations
- A Symbolic Algorithm for Optimal Markov Chain Lumping
- Bounding the lumping error in Markov chain dynamics
- scientific article; zbMATH DE number 4060467
- Lumpability for uncertain continuous-time Markov chains
- A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS
- Lumping in Markov set-chains
- scientific article; zbMATH DE number 95168
- Lumpability and marginalisability for continuous-time Markov chains
Cites work
- scientific article; zbMATH DE number 3145626 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 149518 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 1397300 (Why is no real title available?)
- scientific article; zbMATH DE number 1445805 (Why is no real title available?)
- scientific article; zbMATH DE number 3361678 (Why is no real title available?)
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- Bisimulation through probabilistic testing
- Exact and ordinary lumpability in finite Markov chains
- Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains
- On the computational power of pushdown automata
- Self-adjusting binary search trees
- Three Partition Refinement Algorithms
Cited in
(49)- Combining decomposition and reduction for state space analysis of a self-stabilizing system
- Efficient and modular coalgebraic partition refinement
- Lumpability for uncertain continuous-time Markov chains
- Reasoning about proportional lumpability
- An efficient algorithm to determine probabilistic bisimulation
- Quantitative abstractions for collective adaptive systems
- Polynomial time decision algorithms for probabilistic automata
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Lumping and reversed processes in cooperating automata
- Performance preserving equivalence for stochastic process algebra dtsdPBC
- A space-efficient simulation algorithm on probabilistic automata
- Probabilistic weak simulation is decidable in polynomial time
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- On the Relationships Between Lumpability and Filtering of Finite Stochastic Systems
- Semi-product-form solution for PEPA models with functional rates
- From generic partition refinement to weighted tree automata minimization
- Tempus fugit: How to plug it
- Stochastic Petri net models of \(\text{Ca}^{2+}\) signaling complexes and their analysis
- Lumping evolutionary game dynamics on networks
- Equivalence relations for modular performance evaluation in dtsPBC
- A Symbolic Algorithm for Optimal Markov Chain Lumping
- Individuals, populations and fluid approximations: a Petri net based perspective
- Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
- On the metric-based approximate minimization of Markov chains
- Bisimulation and Simulation Relations for Markov Chains
- Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains
- Minimality Notions via Factorization Systems and Examples
- Towards State Space Reduction Based on T-Lumpability-Consistent Relations
- Distributed Markovian bisimulation reduction aimed at CSL model checking
- Simple \(O(m \log n)\) time Markov chain lumping
- The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
- Probabilistic model checking of complex biological pathways
- Equivalences for fluid stochastic Petri nets
- A preorder relation for Markov reward processes
- Bisimulation relations for weighted automata
- Proportional lumpability and proportional bisimilarity
- Symbolic computation of differential equivalences
- Comparative branching-time semantics for Markov chains
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
- Efficient CTMC Model Checking of Linear Real-Time Objectives
- Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
- Abstract model repair for probabilistic systems
- Differential bisimulation for a Markovian process algebra
- Optimal Grouping of State Spaces of Discrete Stochastic Systems
- Distributed coalgebraic partition refinement
- Generic partition refinement and weighted tree automata
- Efficient Coalgebraic Partition Refinement
- Tackling continuous state-space explosion in a Markovian process algebra
- scientific article; zbMATH DE number 7559464 (Why is no real title available?)
This page was built for publication: Optimal state-space lumping in Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014448)
