Optimal state-space lumping in Markov chains
From MaRDI portal
Publication:1014448
DOI10.1016/S0020-0190(03)00343-0zbMath1189.68039MaRDI QIDQ1014448
Holger Hermanns, Salem Derisavi, William H. Sanders
Publication date: 28 April 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00343-0
68P10: Searching and sorting
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, Minimality Notions via Factorization Systems and Examples, Unnamed Item, Efficient Coalgebraic Partition Refinement, Bisimulation and Simulation Relations for Markov Chains, Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking, Equivalence relations for modular performance evaluation in dtsPBC, The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism, Symbolic computation of differential equivalences, Explainability of probabilistic bisimilarity distances for labelled Markov chains, Lumping and reversed processes in cooperating automata, Lumping evolutionary game dynamics on networks, Individuals, populations and fluid approximations: a Petri net based perspective, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Tackling continuous state-space explosion in a Markovian process algebra, Combining decomposition and reduction for state space analysis of a self-stabilizing system, Polynomial time decision algorithms for probabilistic automata, Reasoning about proportional lumpability, Lumpability for uncertain continuous-time Markov chains, Tempus fugit: How to plug it, Probabilistic weak simulation is decidable in polynomial time, Abstract model repair for probabilistic systems, Stochastic Petri net models of \(\text{Ca}^{2+}\) signaling complexes and their analysis, On the metric-based approximate minimization of Markov chains, From generic partition refinement to weighted tree automata minimization, Proportional lumpability and proportional bisimilarity, Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains, Comparative branching-time semantics for Markov chains, Equivalences for fluid stochastic Petri nets, Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes, Probabilistic model checking of complex biological pathways, Bisimulation relations for weighted automata, A space-efficient simulation algorithm on probabilistic automata, An efficient algorithm to determine probabilistic bisimulation, Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC, A preorder relation for Markov reward processes, Quantitative Abstractions for Collective Adaptive Systems, Semi-Product-Form Solution for PEPA Models with Functional Rates, Differential Bisimulation for a Markovian Process Algebra, Efficient CTMC Model Checking of Linear Real-Time Objectives, Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains, On the Relationships Between Lumpability and Filtering of Finite Stochastic Systems, Towards State Space Reduction Based on T-Lumpability-Consistent Relations
Uses Software
Cites Work
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- Bisimulation through probabilistic testing
- On the computational power of pushdown automata
- Self-adjusting binary search trees
- Three Partition Refinement Algorithms
- Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains
- Exact and ordinary lumpability in finite Markov chains
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
