Optimal state-space lumping in Markov chains
From MaRDI portal
Publication:1014448
DOI10.1016/S0020-0190(03)00343-0zbMath1189.68039OpenAlexW2044811734MaRDI 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
Searching and sorting (68P10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Minimality Notions via Factorization Systems and Examples, Reasoning about proportional lumpability, Lumpability for uncertain continuous-time Markov chains, Lumping and reversed processes in cooperating automata, A space-efficient simulation algorithm on probabilistic automata, Proportional lumpability and proportional bisimilarity, Lumping evolutionary game dynamics on networks, An efficient algorithm to determine probabilistic bisimulation, Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC, Individuals, populations and fluid approximations: a Petri net based perspective, Comparative branching-time semantics for Markov chains, Unnamed Item, A preorder relation for Markov reward processes, Equivalences for fluid stochastic Petri nets, Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes, 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, Differential Bisimulation for a Markovian Process Algebra, Combining decomposition and reduction for state space analysis of a self-stabilizing system, Explainability of probabilistic bisimilarity distances for labelled Markov chains, Abstract model repair for probabilistic systems, 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, Efficient CTMC Model Checking of Linear Real-Time Objectives, Polynomial time decision algorithms for probabilistic automata, From generic partition refinement to weighted tree automata minimization, Probabilistic model checking of complex biological pathways, Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking, Bisimulation relations for weighted automata, Stochastic Petri net models of \(\text{Ca}^{2+}\) signaling complexes and their analysis, Equivalence relations for modular performance evaluation in dtsPBC, Unnamed Item, On the metric-based approximate minimization of Markov chains, Tempus fugit: How to plug it, The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism, Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains, Symbolic computation of differential equivalences, Quantitative Abstractions for Collective Adaptive Systems, Probabilistic weak simulation is decidable in polynomial time, Semi-Product-Form Solution for PEPA Models with Functional Rates, Efficient Coalgebraic Partition Refinement, Bisimulation and Simulation Relations for Markov Chains
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
