On the relations between Markov chain lumpability and reversibility

DOI10.1007/s00236-016-0266-1zbMath1398.60085OpenAlexW2329912647MaRDI QIDQ2406431

Yanyan Li

Publication date: 29 September 2017

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-016-0266-1

zbMATH Keywords

reversibilitylumpabilitystate aggregationautoreversibilitystationarity.

Mathematics Subject Classification ID

Continuous-time Markov processes on discrete state spaces (60J27) Applications of continuous-time Markov processes on discrete state spaces (60J28)

Related Items

Reasoning about proportional lumpability, Proportional lumpability and proportional bisimilarity, Reverse bisimilarity vs. forward bisimilarity, Biased Processor Sharing in Fork-Join Queues, Unnamed Item, Persistent Stochastic Non-Interference, Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses

Uses Software

• SPADES
• PEPA

Cites Work

• Interactive Markov chains. And the quest for quantified quality
• Turning back time in Markovian process algebra.
• An efficient algorithm for computing bisimulation equivalence
• Stability of Product Form G-Networks
• Three Partition Refinement Algorithms
• Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains
• Product-form queueing networks with negative and positive customers
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Exact and ordinary lumpability in finite Markov chains
• Similar States in Continuous-Time Markov Chains
• Analysis and Synthesis of Computer Systems
• A Compositional Approach to Performance Modelling
• Deficiency Zero Petri Nets and Product Form
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item