Exact and ordinary lumpability in finite Markov chains
From MaRDI portal
Publication:4296371
DOI10.2307/3215235zbMath0796.60073OpenAlexW2114710208MaRDI QIDQ4296371
Publication date: 20 September 1994
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3215235
lumpability in finite Markov chainsperformance and reliability modellingstationary and transient analysis
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey ⋮ Deep Statistical Model Checking ⋮ Reasoning about proportional lumpability ⋮ Lumpability for uncertain continuous-time Markov chains ⋮ On Block Skip Free Transition Matrices and First Passage Times ⋮ Non-bisimulation-based Markovian behavioral equivalences ⋮ State space truncation with quantified errors for accurate solutions to discrete chemical master equation ⋮ Proportional lumpability and proportional bisimilarity ⋮ Unnamed Item ⋮ Lumping evolutionary game dynamics on networks ⋮ Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC ⋮ Combining Model Reductions ⋮ Individuals, populations and fluid approximations: a Petri net based perspective ⋮ A Semantics for Every GSPN ⋮ Comparative branching-time semantics for Markov chains ⋮ A preorder relation for Markov reward processes ⋮ On the relations between Markov chain lumpability and reversibility ⋮ Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes ⋮ Tackling continuous state-space explosion in a Markovian process algebra ⋮ Differential Bisimulation for a Markovian Process Algebra ⋮ A notion of equivalence for stochastic Petri nets ⋮ Markov chain aggregation and its applications to combinatorial reaction networks ⋮ Reverse bisimilarity vs. forward bisimilarity ⋮ Learning Markov Models Via Low-Rank Optimization ⋮ Lumping the Approximate Master Equation for Multistate Processes on Complex Networks ⋮ Modular rewritable Petri nets: an efficient model for dynamic distributed systems ⋮ Lumpability abstractions of rule-based systems ⋮ Jump longer to jump less: improving dynamic boundary projection with \(h\)-scaling ⋮ Quantitative Coarse-Graining of Markov Chains ⋮ Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains ⋮ On the Relationships Between Lumpability and Filtering of Finite Stochastic Systems ⋮ Efficient computation in the IM model ⋮ On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context ⋮ Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains ⋮ Towards State Space Reduction Based on T-Lumpability-Consistent Relations ⋮ Exact fluid lumpability in Markovian process algebra ⋮ Aggregation of stochastic automata networks with replicas ⋮ On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi ⋮ Bounding reward measures of Markov models using the Markov decision processes ⋮ Iterative component‐wise bounds for the steady‐state distribution of a Markov chain ⋮ A large-scale assessment of exact lumping of quantitative models in the biomodels repository ⋮ Lumpability of linear evolution equations in Banach spaces ⋮ Fragments-based Model Reduction: Some Case Studies ⋮ FORMALISMS FOR SPECIFYING MARKOVIAN POPULATION MODELS ⋮ Compact Markov-modulated models for multiclass trace fitting ⋮ Probabilistic model checking of complex biological pathways ⋮ Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses ⋮ Measuring edge importance: a quantitative analysis of the stochastic shielding approximation for random processes on graphs ⋮ Free Energy of Petri Nets ⋮ Stochastic Petri net models of \(\text{Ca}^{2+}\) signaling complexes and their analysis ⋮ Markov property for a function of a Markov chain: A linear algebra approach ⋮ A unified framework for differential aggregations in Markovian process algebra ⋮ Linear dynamics for the state vector of Markov chain functions ⋮ A fluid analysis framework for a Markovian process algebra ⋮ Non-reversible Monte Carlo simulations of spin models ⋮ Markov chain lumpability and applications to credit risk modelling in compliance with the International Financial Reporting Standard 9 framework ⋮ Process algebra for performance evaluation ⋮ The How and Why of Interactive Markov Chains ⋮ Characterization of exact lumpability for vector fields on smooth manifolds ⋮ Analysis of Markov jump processes under terminal constraints ⋮ An algebraic approach for inferring and using symmetries in rule-based models ⋮ Optimal state-space lumping in Markov chains ⋮ Lumpable continuous-time stochastic automata networks. ⋮ Symbolic computation of differential equivalences ⋮ Quantitative Abstractions for Collective Adaptive Systems ⋮ A feedback algorithm for determining search parameters for Monte Carlo optimization ⋮ Probabilistic weak simulation is decidable in polynomial time ⋮ Formalisms for Specifying Markovian Population Models ⋮ Approximate lumpability for Markovian agent-based models using local symmetries ⋮ Exact performance equivalence: An equivalence relation for stochastic automata ⋮ Balanced partitions for Markov chains ⋮ Quantitative static analysis of communication protocols using abstract Markov chains ⋮ Combinatorics of the 2-species exclusion processes, marked Laguerre histories, and partially signed permutations ⋮ Coarse-Graining Open Markov Processes ⋮ Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes ⋮ A new general analytical approach for modeling patterns of genetic differentiation and effective size of subdivided populations over time ⋮ Bisimulation and Simulation Relations for Markov Chains ⋮ Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity
